A dichotomy for local small-bias generators
From MaRDI portal
Publication:315550
DOI10.1007/s00145-015-9202-8zbMath1348.94031OpenAlexW2142458674MaRDI QIDQ315550
Benny Applebaum, Andrej Bogdanov, Alon Rosen
Publication date: 21 September 2016
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-015-9202-8
Related Items (max. 100)
Expander-based cryptography meets natural proofs ⋮ On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator ⋮ Oblivious transfer with constant computational overhead ⋮ Unnamed Item ⋮ Expander-Based Cryptography Meets Natural Proofs
Cites Work
- Unnamed Item
- Unnamed Item
- On the security of Goldreich's one-way function
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- Cryptography with constant input locality
- Input locality and hardness amplification
- Pseudorandomness for network algorithms
- Short proofs are narrow—resolution made simple
- Public-key cryptography from different assumptions
- New Algorithms for Learning in Presence of Errors
- Pseudorandom Bits for Polynomials
- Candidate One-Way Functions Based on Expander Graphs
- Three XOR-Lemmas — An Exposition
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Lower Bound on Average-Case Complexity of Inversion of Goldreich’s Function by Drunken Backtracking Algorithms
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Pseudorandom Generators in Propositional Proof Complexity
- Bounded Independence Fools Halfspaces
- Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions
- On ε‐biased generators in NC0
- Pseudorandomness for Read-Once Formulas
- Cryptography in $NC^0$
This page was built for publication: A dichotomy for local small-bias generators
