Predicate Encryption for Circuits from LWE
Name
Vaikuntanathan_Predicate.pdf
Size
528.87 KB
Format
Adobe PDF
Checksum (MD5)
337a16336bf2f807d28664321bab18f1
Author(s)
Gorbunov, Sergey
Vaikuntanathan, Vinod
Wee, Hoeteck
Date Issued
August 2015
Journal
Advances in Cryptology -- CRYPTO 2015
Publisher
Springer
Citation
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.
Version
Author's final manuscript
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/978-3-662-48000-7_25
