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

Pratish Datta; Ratna Dutta; Sourav Mukhopadhyay

Paper 2015/884

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

Pratish Datta, Ratna Dutta, and Sourav Mukhopadhyay

Abstract

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.

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Major revision. ISC 2015
Keywords: RABE for circuits polynomial size circuits multilinear map
Contact author(s): pratishdatta @ gmail com
History: 2015-09-13: received
Short URL: https://ia.cr/2015/884
License: CC BY

BibTeX

@misc{cryptoeprint:2015/884,
      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},
      url = {https://eprint.iacr.org/2015/884}
}