.png){kind=icon}
Return
Attribute hiding subset predicate encryption: Quantum-resistant construction with efficient decryption
.png){kind=icon}
PRE
AI
DOI：10.1016/j.csi.2023.103796.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Attribute-hiding
Access control
Subset predicate
Quantum-resistance
Lattices
Journal
C
IF:
3.1
Papers:
2.3K
Citations:
2.0K
Organization
Cited Papers
ShareSaveHidden Ciphertext Policy Attribute-Based Encryption With Fast Decryption for Personal Health Record System.png)
IEEE ACCESS
OAAI
IEEE ACCESSIF3.6
OAAIShareSaveOptimization of a low-energy, high brightness electron gun for inverse photoemission spectrometersOAAI
OAAIShareSaveShareSaveShareSave
ShareSave
View more