Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions

DOI10.1137/100814421zbMath1343.94060OpenAlexW2017520109MaRDI QIDQ2848227

Omer Reingold, Iftach Haitner, Salil P. Vadhan

Publication date: 25 September 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/100814421

zbMATH Keywords

pseudorandom generatorsone-way functionspseudoentropy

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Random number generation in numerical analysis (65C10)

Related Items (13)

Security levels in steganography -- insecurity does not imply detectability ⋮ Non-adaptive universal one-way hash functions from arbitrary one-way functions ⋮ Sampling Graphs without Forbidden Subgraphs and Unbalanced Expanders with Negligible Error ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Simple constructions from (almost) regular one-way functions ⋮ Unnamed Item ⋮ Computational fuzzy extractors ⋮ Computational Two-Party Correlation: A Dichotomy for Key-Agreement Protocols ⋮ On Nonadaptive Reductions to the Set of Random Strings and Its Dense Subsets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Pseudorandom Functions: Three Decades Later ⋮ The Many Entropies in One-Way Functions

This page was built for publication: Efficiency Improvements in Constructing Pseudorandom Generators from One-Way Functions