{"title":"Privacy enhanced secure compact attribute-based signature from MQ problem for monotone span program","authors":"Jayashree Dey, Ratna Dutta","doi":"10.1016/j.tcs.2024.114929","DOIUrl":null,"url":null,"abstract":"<div><div>The rapid advancement of computer networks has led to an increase in the exposure of messages within an open environment (cloud). Therefore, the confidentiality of the user's signing information is extremely essential to handle unauthorized access and alterations. <em>Attribute-based signature</em> (ABS) scheme is a significant primitive that ensures the privacy of the user's signing information. To endorse a message, the signer can generate a signature with his/her attributes that satisfy a policy without revealing any other information. Post-quantum attribute-based signature schemes are attractive construction options whose safety do not collapse in presence of quantum computers. This article presents the <em>first</em> attribute-based signature scheme in multivariate quadratic (MQ) setting. To generate the secret signing key, the salted-UOV technique is employed in our protocol. While signing, the well-known 3-pass identification protocol is coupled with the Fiat-Shamir transformation. More positively, our candidate relies on presenting the policy as a monotone span program. We also study existential unforgeability and the perfect privacy feature which ensures that a signature cannot be linked to any signing information. Moreover, our scheme is compact in the sense that it performs efficiently in terms of storage when contrasted to the existing post-quantum attribute-based signature schemes.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1020 ","pages":"Article 114929"},"PeriodicalIF":0.9000,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397524005462","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
The rapid advancement of computer networks has led to an increase in the exposure of messages within an open environment (cloud). Therefore, the confidentiality of the user's signing information is extremely essential to handle unauthorized access and alterations. Attribute-based signature (ABS) scheme is a significant primitive that ensures the privacy of the user's signing information. To endorse a message, the signer can generate a signature with his/her attributes that satisfy a policy without revealing any other information. Post-quantum attribute-based signature schemes are attractive construction options whose safety do not collapse in presence of quantum computers. This article presents the first attribute-based signature scheme in multivariate quadratic (MQ) setting. To generate the secret signing key, the salted-UOV technique is employed in our protocol. While signing, the well-known 3-pass identification protocol is coupled with the Fiat-Shamir transformation. More positively, our candidate relies on presenting the policy as a monotone span program. We also study existential unforgeability and the perfect privacy feature which ensures that a signature cannot be linked to any signing information. Moreover, our scheme is compact in the sense that it performs efficiently in terms of storage when contrasted to the existing post-quantum attribute-based signature schemes.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.