Efficiency improvements in constructing pseudorandom generators from one-way functions

Iftach Haitner*, Omer Reingold, Salil Vadhan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

47 Scopus citations

Abstract

We give a new construction of pseudorandom generators from any one-way function. The construction achieves better parameters and is simpler than that given in the seminal work of Hastad, Impagliazzo, Levin, and Luby [SICOMP '99]. The key to our construction is a new notion of next-block pseudoentropy, which is inspired by the notion of "inaccessible entropy" recently introduced in [Haitner, Reingold, Vadhan, Wee, STOC '09]. An additional advantage over previous constructions is that our pseudorandom generators are parallelizable and invoke the one-way function in a non-adaptive manner. Using [Applebaum, Ishai, Kushilevitz, SICOMP '06], this implies the existence of pseudorandom generators in NC0 based on the existence of one-way functions in NC1.

Original languageEnglish
Title of host publicationSTOC'10 - Proceedings of the 2010 ACM International Symposium on Theory of Computing
Pages437-446
Number of pages10
DOIs
StatePublished - 2010
Externally publishedYes
Event42nd ACM Symposium on Theory of Computing, STOC 2010 - Cambridge, MA, United States
Duration: 5 Jun 20108 Jun 2010

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing
ISSN (Print)0737-8017

Conference

Conference42nd ACM Symposium on Theory of Computing, STOC 2010
Country/TerritoryUnited States
CityCambridge, MA
Period5/06/108/06/10

Keywords

  • one-way function
  • pseudorandom generator
  • security preserving

Fingerprint

Dive into the research topics of 'Efficiency improvements in constructing pseudorandom generators from one-way functions'. Together they form a unique fingerprint.

Cite this