Predicate Encryption for Circuits from LWE [chapter]

Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee
2015 Lecture Notes in Computer Science  
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
more » ... ate 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. *
doi:10.1007/978-3-662-48000-7_25 fatcat:sfnrzxcwkbafld3m56ib7hhihy