Paper 2017/652 Original: eprint.iacr.org/2017/652 ↗
Pseudorandom Functions: Three Decades Later
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.
Metadata
- Available format(s)
PDF- Category
- Foundations
- Publication info
- Preprint.
- History
- 2017-07-05: last updated
- 2017-07-05: published
- Short URL
- https://ia.cr/2017/652
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2017/652,
author = {Andrej Bogdanov and Alon Rosen},
title = {Pseudorandom Functions: Three Decades Later},
howpublished = {Cryptology {ePrint} Archive, Paper 2017/652},
year = {2017},
url = {https://eprint.iacr.org/2017/652}
}