Predicate Encryption for Circuits from LWE
In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext μ, and a secret key is associated with a predicate f. Decryption returns plaintext μ if and only if f(x)=1. Moreover, security of predicate encryption guarantees that an adversary learn...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Springer
2017
|
| Online Access: | http://hdl.handle.net/1721.1/112960 https://orcid.org/0000-0002-2666-0045 |
| _version_ | 1826208023312334848 |
|---|---|
| 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 predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext μ, and a secret key is associated with a predicate f. Decryption returns plaintext μ if and only if f(x)=1. Moreover, security of predicate encryption guarantees that an adversary learns nothing about the attribute x or the plaintext μ from a ciphertext, given arbitrary many secret keys that are not authorized to decrypt the ciphertext individually.
We construct a leveled predicate encryption scheme for all circuits, assuming the hardness of the subexponential learning with errors (LWE) problem. That is, for any polynomial function d=d(λ), we construct a predicate encryption scheme for the class of all circuits with depth bounded by d(λ), where λ is the security parameter. |
| first_indexed | 2024-09-23T13:59:09Z |
| format | Article |
| id | mit-1721.1/112960 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:59:09Z |
| publishDate | 2017 |
| publisher | Springer |
| record_format | dspace |
| spelling | mit-1721.1/1129602022-10-01T18:23:57Z Predicate Encryption for Circuits from LWE Gorbunov, Sergey Vaikuntanathan, Vinod Wee, Hoeteck Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Gorbunov, Sergey Vaikuntanathan, Vinod In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext μ, and a secret key is associated with a predicate f. Decryption returns plaintext μ if and only if f(x)=1. Moreover, security of predicate encryption guarantees that an adversary learns nothing about the attribute x or the plaintext μ from a ciphertext, given arbitrary many secret keys that are not authorized to decrypt the ciphertext individually. We construct a leveled predicate encryption scheme for all circuits, assuming the hardness of the subexponential learning with errors (LWE) problem. That is, for any polynomial function d=d(λ), we construct a predicate encryption scheme for the class of all circuits with depth bounded by d(λ), where λ is the security parameter. Microsoft Corporation (PhD Fellowship) Northrop Grumman Cybersecurity Research Consortium United States. Defense Advanced Research Projects Agency (Grant FA8750-11-2-0225) National Science Foundation (U.S.) (Awards CNS-1350619) National Science Foundation (U.S.) (Awards CNS-1413920) Alfred P. Sloan Foundation (Fellowship) Microsoft (Faculty Fellowship) 2017-12-29T14:39:14Z 2017-12-29T14:39:14Z 2015-08 Article http://purl.org/eprint/type/ConferencePaper 978-3-662-47999-5 978-3-662-48000-7 0302-9743 1611-3349 http://hdl.handle.net/1721.1/112960 Gorbunov, Sergey, et al. “Predicate Encryption for Circuits from LWE.” Advances in Cryptology -- CRYPTO 2015, 16-20 August, 2015, Santa Barbara, CA, Springer Berlin Heidelberg, 2015, pp. 503–23. https://orcid.org/0000-0002-2666-0045 en_US http://dx.doi.org/10.1007/978-3-662-48000-7_25 Advances in Cryptology -- CRYPTO 2015 Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/ application/pdf Springer MIT Web Domain |
| spellingShingle | Gorbunov, Sergey Vaikuntanathan, Vinod Wee, Hoeteck Predicate Encryption for Circuits from LWE |
| title | Predicate Encryption for Circuits from LWE |
| title_full | Predicate Encryption for Circuits from LWE |
| title_fullStr | Predicate Encryption for Circuits from LWE |
| title_full_unstemmed | Predicate Encryption for Circuits from LWE |
| title_short | Predicate Encryption for Circuits from LWE |
| title_sort | predicate encryption for circuits from lwe |
| url | http://hdl.handle.net/1721.1/112960 https://orcid.org/0000-0002-2666-0045 |
| work_keys_str_mv | AT gorbunovsergey predicateencryptionforcircuitsfromlwe AT vaikuntanathanvinod predicateencryptionforcircuitsfromlwe AT weehoeteck predicateencryptionforcircuitsfromlwe |