Pseudorandom generators with long stretch and low locality from random local one-way functions

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


We continue the study of locally-computable pseudorandom generators (PRG) G:{0,1} n → {0,1} m that each of their outputs depend on a small number of d input bits. While it is known that such generators are likely to exist for the case of small sub-linear stretch m=n+n 1-δ, it is less clear whether achieving larger stretch such as m=n+Ω(n), or even m=n 1+δ is possible. The existence of such PRGs, which was posed as an open question in previous works, has recently gained an additional motivation due to several interesting applications. We make progress towards resolving this question by obtaining several local constructions based on the one-wayness of "random" local functions - a variant of an assumption made by Goldreich (ECCC 2000). Specifically, we construct collections of PRGs with the following parameters: • Linear stretch m=n+Ω(n) and constant locality d=O(1). • Polynomial stretch m=n 1+δ and any (arbitrarily slowly growing) super-constant locality d=ω(1), e.g., log*n. • Polynomial stretch m=n 1+δ, constant locality d=O(1), and inverse polynomial distinguishing advantage (as opposed to the standard case of n -ω(1)). As an additional contribution, we show that our constructions give rise to strong inapproximability results for the densest-subgraph problem in d-uniform hypergraphs for constant d. This allows us to improve the previous bounds of Feige (STOC 2002) and Khot (FOCS 2004) from constant inapproximability factor to n ε-inapproximability, at the expense of relying on stronger assumptions.

Original languageEnglish
Title of host publicationSTOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing
Number of pages11
StatePublished - 2012
Event44th Annual ACM Symposium on Theory of Computing, STOC '12 - New York, NY, United States
Duration: 19 May 201222 May 2012

Publication series

NameProceedings of the Annual ACM Symposium on Theory of Computing


Conference44th Annual ACM Symposium on Theory of Computing, STOC '12
Country/TerritoryUnited States
CityNew York, NY


  • NC0
  • cryptography
  • densest-subgraph
  • pseudorandomness

All Science Journal Classification (ASJC) codes

  • Software


Dive into the research topics of 'Pseudorandom generators with long stretch and low locality from random local one-way functions'. Together they form a unique fingerprint.

Cite this