Publications-Periodical Articles
Article View/Open
Publication Export
Google ScholarTM
NCCU Library
Citation Infomation
Related Publications in TAIR
| Title | Attribute hiding subset predicate encryption: Quantum-resistant construction with efficient decryption |
| Creator | 曾一凡 Tseng, Yi-Fan |
| Contributor | 資訊系 |
| Key Words | Attribute-hiding; Access control; Subset predicate; Quantum-resistance; Lattices |
| Date | 2024-03 |
| Date Issued | 5-Mar-2024 16:26:59 (UTC+8) |
| Summary | 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. |
| Relation | Computer Standards & Interfaces, Vol.88, 103796 |
| Type | article |
| DOI | https://doi.org/10.1016/j.csi.2023.103796 |
| dc.contributor | 資訊系 | |
| dc.creator (作者) | 曾一凡 | |
| dc.creator (作者) | Tseng, Yi-Fan | |
| dc.date (日期) | 2024-03 | |
| dc.date.accessioned | 5-Mar-2024 16:26:59 (UTC+8) | - |
| dc.date.available | 5-Mar-2024 16:26:59 (UTC+8) | - |
| dc.date.issued (上傳時間) | 5-Mar-2024 16:26:59 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/150400 | - |
| dc.description.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. | |
| dc.format.extent | 105 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Computer Standards & Interfaces, Vol.88, 103796 | |
| dc.subject (關鍵詞) | Attribute-hiding; Access control; Subset predicate; Quantum-resistance; Lattices | |
| dc.title (題名) | Attribute hiding subset predicate encryption: Quantum-resistant construction with efficient decryption | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1016/j.csi.2023.103796 | |
| dc.doi.uri (DOI) | https://doi.org/10.1016/j.csi.2023.103796 |