Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / attribute-based encryption, large universe, unbounded, q-type assumptions, ciphertext-policy, key-policy

Date: received 12 Oct 2012, last revised 28 Aug 2014

Contact author: jrous at cs utexas edu

Available format(s): PDF | BibTeX Citation

Version: 20140828:060226 (All versions of this report)

Short URL: ia.cr/2012/583

Discussion forum: Show discussion | Start new discussion