On the Power of the Randomized Iterate

DOI10.1137/080721820zbMath1236.94055OpenAlexW2119871351MaRDI QIDQ3225163

Omer Reingold, Iftach Haitner, Danny Harnik

Publication date: 15 March 2012

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

Full work available at URL: https://semanticscholar.org/paper/718a4b528a0bf712ca8862751c8b2c8895c8cb67

zbMATH Keywords

cryptographypseudorandom generatorhardness amplificationone-way functions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (7)

Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs ⋮ A new interactive hashing theorem ⋮ Pseudorandom generators from regular one-way functions: new constructions with improved parameters ⋮ On linear-size pseudorandom generators and hardcore functions ⋮ The Many Entropies in One-Way Functions

This page was built for publication: On the Power of the Randomized Iterate