A dichotomy for local small-bias generators
From MaRDI portal
Publication:315550
Recommendations
Cites work
- scientific article; zbMATH DE number 1834654 (Why is no real title available?)
- Bounded Independence Fools Halfspaces
- Candidate one-way functions based on expander graphs
- Correlation-immunity of nonlinear combining functions for cryptographic applications (Corresp.)
- Cryptography in $NC^0$
- Cryptography with constant computational overhead
- Cryptography with constant input locality
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas
- Goldreich’s One-Way Function Candidate and Myopic Backtracking Algorithms
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Input locality and hardness amplification
- Lower bound on average-case complexity of inversion of Goldreich's function by drunken backtracking algorithms
- New Algorithms for Learning in Presence of Errors
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- On the security of Goldreich's one-way function
- On ε‐biased generators in NC0
- Pseudorandom Generators in Propositional Proof Complexity
- Pseudorandom bits for polynomials
- Pseudorandom generators with long stretch and low locality from random local one-way functions
- Pseudorandomness for Read-Once Formulas
- Pseudorandomness for network algorithms
- Public-key cryptography from different assumptions
- Short proofs are narrow -- resolution made simple
- Small-Bias Probability Spaces: Efficient Constructions and Applications
- Three XOR-lemmas -- an exposition
Cited in
(12)- Expander-based cryptography meets natural proofs
- Algebraic attacks against random local functions and their countermeasures
- Some limitations of the sum of small-bias distributions
- Expander-Based Cryptography Meets Natural Proofs
- Public-key encryption, local pseudorandom generators, and the low-degree method
- Small bias requires large formulas
- Fast public-key silent OT and more from constrained Naor-Reingold
- A dichotomy for local small-bias generators
- On the algebraic immunity -- resiliency trade-off, implications for Goldreich's pseudorandom generator
- Oblivious transfer with constant computational overhead
- scientific article; zbMATH DE number 7758323 (Why is no real title available?)
- Algebraic attacks against random local functions and their countermeasures
This page was built for publication: A dichotomy for local small-bias generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315550)
