Private Constrained PRFs (and More) from LWE
© 2017, International Association for Cryptologic Research. In a constrained PRF, the owner of the PRF key K can generate constrained keys K_f that allow anyone to evaluate the PRF on inputs x that satisfy the predicate f (namely, where f(x) is “true”) but reveal no information about the PRF evaluat...
Main Authors: | Brakerski, Zvika, Tsabary, Rotem, Vaikuntanathan, Vinod, Wee, Hoeteck |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
Springer International Publishing
2021
|
Online Access: | https://hdl.handle.net/1721.1/137864 |
Similar Items
-
Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
by: Brakerski, Zvika, et al.
Published: (2021) -
Obfuscating Conjunctions under Entropic Ring LWE
by: Brakerski, Zvika, et al.
Published: (2017) -
Efficient Fully Homomorphic Encryption from (Standard) LWE
by: Brakerski, Zvika, et al.
Published: (2018) -
Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
by: Brakerski, Zvika, et al.
Published: (2017) -
Predicate Encryption for Circuits from LWE
by: Gorbunov, Sergey, et al.
Published: (2017)