{"title":"Attribute hiding subset predicate encryption: Quantum-resistant construction with efficient decryption","authors":"Yi-Fan Tseng","doi":"10.1016/j.csi.2023.103796","DOIUrl":null,"url":null,"abstract":"<div><p><span>Predicate encryption is well studied due to its flexibility in supporting fine-grained access control. In Katz et al. (2018) proposed a predicate encryption for a new predicate family, called subset predicate encryption. In such a scheme, a ciphertext and a private key are associated with sets. A private key can successfully decrypt a ciphertext if and only if the set for the private key is a subset of the set for the ciphertext. However, we found that, all the existing schemes are not able to hide the sets associated to ciphertexts, i.e., the information of receivers will be revealed. To enhance the privacy for receivers, we proposed the first subset predicate </span>encryption schemes<span> with weakly attribute hiding. Moreover, our first scheme is constructed over lattices, which is believed to be secure against quantum computers. The security of our scheme is formally proven in the standard model under well-studied complexity assumptions.</span></p></div>","PeriodicalId":50635,"journal":{"name":"Computer Standards & Interfaces","volume":null,"pages":null},"PeriodicalIF":4.1000,"publicationDate":"2023-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Standards & Interfaces","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0920548923000776","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0
Abstract
Predicate encryption is well studied due to its flexibility in supporting fine-grained access control. In Katz et al. (2018) proposed a predicate encryption for a new predicate family, called subset predicate encryption. In such a scheme, a ciphertext and a private key are associated with sets. A private key can successfully decrypt a ciphertext if and only if the set for the private key is a subset of the set for the ciphertext. However, we found that, all the existing schemes are not able to hide the sets associated to ciphertexts, i.e., the information of receivers will be revealed. To enhance the privacy for receivers, we proposed the first subset predicate encryption schemes with weakly attribute hiding. Moreover, our first scheme is constructed over lattices, which is believed to be secure against quantum computers. The security of our scheme is formally proven in the standard model under well-studied complexity assumptions.
期刊介绍:
The quality of software, well-defined interfaces (hardware and software), the process of digitalisation, and accepted standards in these fields are essential for building and exploiting complex computing, communication, multimedia and measuring systems. Standards can simplify the design and construction of individual hardware and software components and help to ensure satisfactory interworking.
Computer Standards & Interfaces is an international journal dealing specifically with these topics.
The journal
• Provides information about activities and progress on the definition of computer standards, software quality, interfaces and methods, at national, European and international levels
• Publishes critical comments on standards and standards activities
• Disseminates user''s experiences and case studies in the application and exploitation of established or emerging standards, interfaces and methods
• Offers a forum for discussion on actual projects, standards, interfaces and methods by recognised experts
• Stimulates relevant research by providing a specialised refereed medium.