On the Existence of Pseudorandom Generators
From MaRDI portal
Publication:4277535
DOI10.1137/0222069zbMath0795.94011OpenAlexW2056002932MaRDI QIDQ4277535
Michael Luby, Hugo Krawczyk, Oded Goldreich
Publication date: 13 September 1994
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0222069
Cryptography (94A60) Random number generation in numerical analysis (65C10) Theory of computing (68Q99)
Related Items
On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \), Garbling XOR gates ``for free in the standard model, Pseudoentropy: Lower-Bounds for Chain Rules and Transformations, (Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond, Zeta functions, one-way functions, and pseudorandom number generators., The function-inversion problem: barriers and opportunities, Channels of small log-ratio leakage and characterization of two-party differentially private computation, Paradigms for Unconditional Pseudorandom Generators, Unnamed Item, Input locality and hardness amplification, Simple constructions from (almost) regular one-way functions, 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, Collision-Free Hashing from Lattice Problems, Encryption modes with almost free message integrity, Reducing complexity assumptions for statistically-hiding commitment, Towards Sound Fresh Re-keying with Hard (Physical) Learning Problems, Cryptography with constant input locality, Sharing privacy protected and statistically sound clinical research data using outsourced data storage, The Complexity of Public-Key Cryptography, The Many Entropies in One-Way Functions, Randomness vs time: Derandomization under a uniform assumption
