Predicate Encryption for Circuits from LWE
Author(s)
Gorbunov, Sergey; Vaikuntanathan, Vinod; Wee, Hoeteck
DownloadVaikuntanathan_Predicate.pdf (528.8Kb)
OPEN_ACCESS_POLICY
Open Access Policy
Creative Commons Attribution-Noncommercial-Share Alike
Terms of use
Metadata
Show full item recordAbstract
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.
Date issued
2015-08Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer ScienceJournal
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
ISBN
978-3-662-47999-5
978-3-662-48000-7
ISSN
0302-9743
1611-3349