Paper 2015/884

General Circuit Realizing Compact Revocable Attribute-Based Encryption from Multilinear Maps

Pratish Datta, Ratna Dutta, and Sourav Mukhopadhyay


This paper demonstrates new technique for managing revocation in the context of attribute-based encryption (ABE) and presents two selectively secure directly revocable ABE (RABE) constructions – supporting decryption policies realizable by polynomial size Boolean circuits of arbitrary fan-out and – featuring compactness in the sense that the number of revocation controlling components in ciphertexts and decryption keys are constant. In fact, our RABE schemes are the first to achieve these parameters. Both our constructions utilize multilinear maps. The size of public parameter in our first construction is linear to the maximum number of users supported by the system while in the second construction we reduce it to logarithmic.

Available format(s)
Public-key cryptography
Publication info
Published elsewhere. Major revision. ISC 2015
RABE for circuitspolynomial size circuitsmultilinear map
Contact author(s)
pratishdatta @ gmail com
2015-09-13: received
Short URL
Creative Commons Attribution


      author = {Pratish Datta and Ratna Dutta and Sourav Mukhopadhyay},
      title = {General Circuit Realizing Compact Revocable Attribute-Based Encryption from Multilinear Maps},
      howpublished = {Cryptology ePrint Archive, Paper 2015/884},
      year = {2015},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.