On linear-size pseudorandom generators and hardcore functions
From MaRDI portal
Publication:744085
DOI10.1016/J.TCS.2014.06.013zbMATH Open1384.94032OpenAlexW2043814918MaRDI QIDQ744085FDOQ744085
Rafail Ostrovsky, Joshua Baron, Yuval Ishai
Publication date: 6 October 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2014.06.013
Recommendations
- On linear-size pseudorandom generators and hardcore functions
- Theory of Cryptography
- The complexity of constructing pseudorandom generators from hard functions
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
- The randomized iterate, revisited -- almost linear seed length PRGs from a broader class of one-way functions
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Pseudo-random numbers; Monte Carlo methods (11K45)
Cites Work
- A Pseudorandom Generator from any One-way Function
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Foundations of Cryptography
- Cryptography with constant computational overhead
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- On the Existence of Pseudorandom Generators
- Cryptography in $NC^0$
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- On the Security of Goldreich’s One-Way Function
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Title not available (Why is that?)
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- On the Power of the Randomized Iterate
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
- Advances in Cryptology – CRYPTO 2004
- On the Power of the Randomized Iterate
- Theory of Cryptography
Cited In (9)
- Oblivious transfer with constant computational overhead
- Pseudo-random generators for all hardnesses
- Ligero: lightweight sublinear arguments without a trusted setup
- How to recover a secret with \(O(n)\) additions
- Asymptotically quasi-optimal cryptography
- The complexity of constructing pseudorandom generators from hard functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution
This page was built for publication: On linear-size pseudorandom generators and hardcore functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744085)
