Paper 2012/616
Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions
Nishanth Chandran and Sanjam Garg
Abstract
We revisit hardness-preserving constructions of a pseudo-random function (PRF) from any length doubling pseudo-random generator (PRG) when there is a non-trivial upper bound
Note: Fixed citations and typos.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Indocrypt 2014
- Keywords
- pseudorandom functionshardness preservationpseudorandom generators
- Contact author(s)
-
nishanth @ cs ucla edu
sanjamg @ berkeley edu - History
- 2015-02-13: revised
- 2012-11-01: received
- See all versions
- Short URL
- https://ia.cr/2012/616
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2012/616, author = {Nishanth Chandran and Sanjam Garg}, title = {Balancing Output Length and Query Bound in Hardness Preserving Constructions of Pseudorandom Functions}, howpublished = {Cryptology {ePrint} Archive, Paper 2012/616}, year = {2012}, url = {https://eprint.iacr.org/2012/616} }