Efficiency improvements in constructing pseudorandom generators from one-way functions

DOI10.1145/1806689.1806750zbMath1293.65006OpenAlexW2162860799MaRDI QIDQ2875171

Iftach Haitner, Omer Reingold, Salil P. Vadhan

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: http://nrs.harvard.edu/urn-3:HUL.InstRepos:4879174

zbMATH Keywords

pseudorandom generatorone-way functionsecurity preserving

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 (12)

A New Pseudorandom Generator from Collision-Resistant Hash Functions ⋮ Pseudoentropy: Lower-Bounds for Chain Rules and Transformations ⋮ The Chain Rule for HILL Pseudoentropy, Revisited ⋮ Metric Pseudoentropy: Characterizations, Transformations and Applications ⋮ On derandomizing Yao's weak-to-strong OWF construction ⋮ Homomorphic Evaluation Requires Depth ⋮ Pseudorandom generators from regular one-way functions: new constructions with improved parameters ⋮ On the complexity of constructing pseudorandom functions (especially when they don't exist) ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ On Constructing 1-1 One-Way Functions ⋮ Unnamed Item ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer

This page was built for publication: Efficiency improvements in constructing pseudorandom generators from one-way functions