We present a new methodology for realizing Ciphertext-Policy Attribute Encryption (CP-ABE) under concrete and noninteractive cryptographic assumptions in the standard model. Our solutions allow any encryptor to specify access control in terms of any access formula over the attributes in the system. In our most efficient system, ciphertext size, encryption, and decryption time scales linearly with the complexity of the access formula. The only previous work to achieve these parameters was limited to a proof in the generic group model. We present three constructions within our framework. Our first system is proven selectively secure under a assumption that we call the decisional Parallel Bilinear Diffie-Hellman Exponent (PBDHE) assumption which can be viewed as a generalization of the BDHE assumption. Our next two constructions provide performance tradeoffs to achieve provable security respectively under the (weaker) decisional Bilinear-Diffie-Hellman Exponent and decisional Bilinear Diffie-Hellman assumptions.
Available format(s) PDF Publication info Published elsewhere. Unknown where it was published Contact author(s) bwaters @ cs utexas edu History 2010-12-20: last of 6 revisions 2008-07-03: received See all versions Short URL https://ia.cr/2008/290 License
CC BY
BibTeX Copy to clipboard
@misc, title = , howpublished = Archive, Paper 2008/290>, year = , url = >
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.