Attribute-Based Encryption for Circuits
In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an ℓ-bit public index ind and a message m, and a secret key is associated with a Boolean predicate P. The secret key allows decrypting the ciphertext and learning m if and only if P(ind) = 1. Moreover, the scheme should b...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Association for Computing Machinery (ACM)
2017
|
| Online Access: | http://hdl.handle.net/1721.1/111074 https://orcid.org/0000-0002-2666-0045 |
| _version_ | 1811085270300229632 |
|---|---|
| author | Gorbunov, Sergey Vaikuntanathan, Vinod Wee, Hoeteck |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Gorbunov, Sergey Vaikuntanathan, Vinod Wee, Hoeteck |
| author_sort | Gorbunov, Sergey |
| collection | MIT |
| description | In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an ℓ-bit public index ind and a message m, and a secret key is associated with a Boolean predicate P. The secret key allows decrypting the ciphertext and learning m if and only if P(ind) = 1. Moreover, the scheme should be secure against collusions of users, namely, given secret keys for polynomially many predicates, an adversary learns nothing about the message if none of the secret keys can individually decrypt the ciphertext.
We present attribute-based encryption schemes for circuits of any arbitrary polynomial size, where the public parameters and the ciphertext grow linearly with the depth of the circuit. Our construction is secure under the standard learning with errors (LWE) assumption. Previous constructions of attribute-based encryption were for Boolean formulas, captured by the complexity class NC1.
In the course of our construction, we present a new framework for constructing ABE schemes. As a by-product of our framework, we obtain ABE schemes for polynomial-size branching programs, corresponding to the complexity class LOGSPACE, under quantitatively better assumptions. |
| first_indexed | 2024-09-23T13:06:17Z |
| format | Article |
| id | mit-1721.1/111074 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:06:17Z |
| publishDate | 2017 |
| publisher | Association for Computing Machinery (ACM) |
| record_format | dspace |
| spelling | mit-1721.1/1110742022-10-01T13:05:29Z Attribute-Based Encryption for Circuits Gorbunov, Sergey Vaikuntanathan, Vinod Wee, Hoeteck Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Vaikuntanathan, Vinod In an attribute-based encryption (ABE) scheme, a ciphertext is associated with an ℓ-bit public index ind and a message m, and a secret key is associated with a Boolean predicate P. The secret key allows decrypting the ciphertext and learning m if and only if P(ind) = 1. Moreover, the scheme should be secure against collusions of users, namely, given secret keys for polynomially many predicates, an adversary learns nothing about the message if none of the secret keys can individually decrypt the ciphertext. We present attribute-based encryption schemes for circuits of any arbitrary polynomial size, where the public parameters and the ciphertext grow linearly with the depth of the circuit. Our construction is secure under the standard learning with errors (LWE) assumption. Previous constructions of attribute-based encryption were for Boolean formulas, captured by the complexity class NC1. In the course of our construction, we present a new framework for constructing ABE schemes. As a by-product of our framework, we obtain ABE schemes for polynomial-size branching programs, corresponding to the complexity class LOGSPACE, under quantitatively better assumptions. United States. Defense Advanced Research Projects Agency (FA8750-11-2-0225) 2017-08-30T19:37:11Z 2017-08-30T19:37:11Z 2015-12 2013-05 Article http://purl.org/eprint/type/JournalArticle 0004-5411 http://hdl.handle.net/1721.1/111074 Gorbunov, Sergey et al. “Attribute-Based Encryption for Circuits.” Journal of the ACM 62, 6 (December 2015): 1–33 © 2015 Association for Computing Machinery (ACM) https://orcid.org/0000-0002-2666-0045 en_US http://dx.doi.org/10.1145/2824233 Journal of the ACM Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Association for Computing Machinery (ACM) MIT Web Domain |
| spellingShingle | Gorbunov, Sergey Vaikuntanathan, Vinod Wee, Hoeteck Attribute-Based Encryption for Circuits |
| title | Attribute-Based Encryption for Circuits |
| title_full | Attribute-Based Encryption for Circuits |
| title_fullStr | Attribute-Based Encryption for Circuits |
| title_full_unstemmed | Attribute-Based Encryption for Circuits |
| title_short | Attribute-Based Encryption for Circuits |
| title_sort | attribute based encryption for circuits |
| url | http://hdl.handle.net/1721.1/111074 https://orcid.org/0000-0002-2666-0045 |
| work_keys_str_mv | AT gorbunovsergey attributebasedencryptionforcircuits AT vaikuntanathanvinod attributebasedencryptionforcircuits AT weehoeteck attributebasedencryptionforcircuits |