[Resource Topic] 2015/029: Predicate Encryption for Circuits from LWE

Welcome to the resource topic for 2015/029

Predicate Encryption for Circuits from LWE

Authors: Sergey Gorbunov, Vinod Vaikuntanathan, Hoeteck Wee


In predicate encryption, a ciphertext is associated with descriptive attribute values x in addition to a plaintext \mu, and a secret key is associated with a predicate f. Decryption returns plaintext \mu 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 \mu 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(\secp), we construct a predicate encryption scheme for the class of all circuits with depth bounded by d(\secp), where \secp is the security parameter.

ePrint: https://eprint.iacr.org/2015/029

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .