Efficient revocable and grantable attribute‐based encryption from lattices with fine‐grained access control
Shangping Wang, Xia Zhang, Yaling Zhang · IET Information Security · 2017
Attribute‐based encryption (ABE) has been regarded as an attractive alternative to identity‐based encryption. The feature of the ABE is that it has the ability of fine‐grained access control. Access control is an effective way to ensure data security. Revocable and grantable ABE (RABE) is an extension of ABE. In this study, an efficient RABE scheme is proposed. Binary tree technique is used to deal with the issues of attribute revocation and granting. The security of the scheme is proved to be selectively secure in the standard model under the learning with errors assumption.