Welcome to the resource topic for 2011/401
Title:
Pseudorandom Functions and Lattices
Authors: Abhishek Banerjee, Chris Peikert, Alon Rosen
Abstract:We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically efficient and highly parallelizable in a practical sense, i.e., they can be computed by simple, relatively \emph{small} low-depth arithmetic or boolean circuits (e.g., in NC$^{1} or even TC^{0}$). In addition, they are the first low-depth PRFs that have no known attack by efficient quantum algorithms. Central to our results is a new ``derandomization’’ technique for the learning with errors (\lwe) problem which, in effect, generates the error terms deterministically.
ePrint: https://eprint.iacr.org/2011/401
Talk: https://www.youtube.com/watch?v=Ebt9vnaXyMc
Slides: https://iacr.org/cryptodb/archive/2012/EUROCRYPT/presentation/24252.pdf
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 .