Paper 2012/583

New Constructions and Proof Methods for Large Universe Attribute-Based Encryption

Yannis Rouselakis and Brent Waters

Abstract

We propose two large universe Attribute-Based Encryption constructions. In a large universe ABE construction any string can be used as an attribute and attributes need not be enumerated at system setup. Our first construction establishes a novel large universe Ciphertext-Policy ABE scheme on prime order bilinear groups, while the second achieves a significant efficiency improvement over the large universe Key-Policy ABE systems of Lewko-Waters and Lewko. Both schemes are selectively secure in the standard model under two "q-type" assumptions similar to ones used in prior works. Our work brings back "program and cancel" techniques to this problem. We provide implementations and benchmarks of our constructions in Charm; a programming environment for rapid prototyping of cryptographic primitives.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown status
Keywords
attribute-based encryptionlarge universeunboundedq-type assumptionsciphertext-policykey-policy
Contact author(s)
jrous @ cs utexas edu
History
2014-08-28: revised
2012-10-16: received
See all versions
Short URL
https://ia.cr/2012/583
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2012/583,
      author = {Yannis Rouselakis and Brent Waters},
      title = {New Constructions and Proof Methods for Large Universe Attribute-Based Encryption},
      howpublished = {Cryptology ePrint Archive, Paper 2012/583},
      year = {2012},
      note = {\url{https://eprint.iacr.org/2012/583}},
      url = {https://eprint.iacr.org/2012/583}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.