Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR17-113 | 1st July 2017 09:18

Pseudorandom Functions: Three Decades Later

RSS-Feed




TR17-113
Authors: Andrej Bogdanov, Alon Rosen
Publication: 1st July 2017 10:31
Downloads: 413
Keywords: 


Abstract:

In 1984, Goldreich, Goldwasser and Micali formalized the concept of pseudorandom functions and proposed a construction based on any length-doubling pseudorandom generator. Since then, pseudorandom functions have turned out to be an extremely influential abstraction, with applications ranging from message authentication to barriers in proving computational complexity lower bounds.

In this tutorial we survey various incarnations of pseudorandom functions, giving self-contained proofs of key results from the literature. Our main focus is on feasibility results and constructions, as well as on limitations of (and induced by) pseudorandom functions. Along the way we point out some open questions that we believe to be within reach of current techniques.

This survey appeared in the book Tutorials on the Foundations of Cryptography, published in honor of Oded Goldreich’s 60th birthday.



ISSN 1433-8092 | Imprint