On linear-size pseudorandom generators and hardcore functions
From MaRDI portal
Publication:744085
DOI10.1016/j.tcs.2014.06.013zbMath1384.94032OpenAlexW2043814918MaRDI QIDQ744085
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
Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (4)
Asymptotically quasi-optimal cryptography ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Oblivious transfer with constant computational overhead ⋮ How to recover a secret with \(O(n)\) additions
Cites Work
- Unnamed Item
- Unnamed Item
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- Efficiency improvements in constructing pseudorandom generators from one-way functions
- On the Power of the Randomized Iterate
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- On the Security of Goldreich’s One-Way Function
- A Pseudorandom Generator from any One-way Function
- On the Existence of Pseudorandom Generators
- Foundations of Cryptography
- Advances in Cryptology – CRYPTO 2004
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Characterizing pseudoentropy and simplifying pseudorandom generator constructions
- On the Power of the Randomized Iterate
- Cryptography in $NC^0$
- Theory of Cryptography
This page was built for publication: On linear-size pseudorandom generators and hardcore functions
