Paper 2014/772
Fully Secure and Succinct Attribute Based Encryption for Circuits from Multi-linear Maps
Nuttapong Attrapadung
Abstract
We propose new fully secure attribute based encryption (ABE) systems for polynomial-size circuits in both key-policy and ciphertext-policy flavors. All the previous ABE systems for circuits were proved only selectively secure. Our schemes are based on asymmetric graded encoding systems in composite-order settings. The assumptions consist of the Subgroup Decision assumptions and two assumptions which are similar to Multi-linear Decisional Diffie-Hellman assumption (but more complex) and are proved to hold in the generic graded encoding model. Both of our systems enjoy succinctness: key and ciphertext sizes are proportional to their corresponding circuit and input string sizes. Our ciphertext-policy ABE for circuits is the first to achieve succinctness, and the first that can deal with unbounded-size circuits (even among selectively secure systems). We develop new techniques for proving co-selective security of key-policy ABE for circuits, which is the main ingredient for the dual-system encryption framework that uses computational arguments for enforcing full security.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Attribute-based encryption for circuitsFull securityMulti-linear mapsDual system encryptionCiphertext-policyKey-policySuccinctness
- Contact author(s)
- n attrapadung @ aist go jp
- History
- 2014-10-01: received
- Short URL
- https://ia.cr/2014/772
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/772,
author = {Nuttapong Attrapadung},
title = {Fully Secure and Succinct Attribute Based Encryption for Circuits from Multi-linear Maps},
howpublished = {Cryptology ePrint Archive, Paper 2014/772},
year = {2014},
note = {\url{https://eprint.iacr.org/2014/772}},
url = {https://eprint.iacr.org/2014/772}
}
