Paper 2021/778

Efficient secret key reusing attribute-based encryption from lattices

Xinyuan Qian and Wenyuan Wu


Attribute-based encryption (ABE) schemes by lattices are likely to resist quantum attacks, and can be widely applied to many Internet of Thing or cloud scenarios. One of the most attractive feature for ABE is the ability of fine-grained access control which provides an effective way to ensure data security. In this work, we propose an efficient ciphertext policy attribute-based encryption scheme based on hardness assumption of LWE. Being different from other similar schemes, a user's secret key can only be generated once only and it can be used to decrypt ciphertext under different access policies by making combinations of secret key fragments. Specially, we propose a method for binding users' secret keys with their attributes and identities, which solves the collusion attack problem. The security of the scheme is proved to be selective secure under the LWE assumption.

Available format(s)
Public-key cryptography
Publication info
Preprint. MINOR revision.
Learning with errorAccess StructureSecret key resuing
Contact author(s)
xinyuanqian @ outlook com
2021-06-09: received
Short URL
Creative Commons Attribution


      author = {Xinyuan Qian and Wenyuan Wu},
      title = {Efficient secret key reusing attribute-based encryption from lattices},
      howpublished = {Cryptology ePrint Archive, Paper 2021/778},
      year = {2021},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.