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


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+n1-δ, it is less clear whether achieving larger stretch such as m=n+Ω(n), or even m=n1+δ is… (More)
DOI: 10.1145/2213977.2214050



Citations per Year

64 Citations

Semantic Scholar estimates that this publication has 64 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics