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: | Gorbunov, Sergey, Vaikuntanathan, Vinod, Wee, Hoeteck |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Springer
2017
|
Online Access: | http://hdl.handle.net/1721.1/112960 https://orcid.org/0000-0002-2666-0045 |
Similar Items
-
Attribute-Based Encryption for Circuits
by: Gorbunov, Sergey, et al.
Published: (2017) -
Efficient Fully Homomorphic Encryption from (Standard) LWE
by: Brakerski, Zvika, et al.
Published: (2018) -
Private Constrained PRFs (and More) from LWE
by: Brakerski, Zvika, et al.
Published: (2021) -
Obfuscating Conjunctions under Entropic Ring LWE
by: Brakerski, Zvika, et al.
Published: (2017) -
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
by: Brakerski, Zvika, et al.
Published: (2017)