scientific article; zbMATH DE number 7378649
From MaRDI portal
Publication:5009532
DOI10.4230/LIPIcs.APPROX-RANDOM.2018.37MaRDI QIDQ5009532
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1602.01530
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The influence of large coalitions
- On pseudorandom generators with linear stretch in \(\mathrm{NC}^{0}\)
- Pseudorandom generators for space-bounded computation
- Universal classes of hash functions
- \(BPP\) has subexponential time simulations unless \(EXPTIME\) has publishable proofs
- Hardness vs randomness
- The complexity of constructing pseudorandom generators from hard functions
- Randomness is linear in space
- Efficient cryptographic schemes provably as secure as subset sum
- Pseudorandomness for network algorithms
- Sparse extractor families for all the entropy
- Candidate One-Way Functions Based on Expander Graphs
- Constant depth circuits, Fourier transform, and learnability
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Tight security proofs for the bounded-storage model
- Extractors Using Hardness Amplification
- Explicit Resilient Functions Matching Ajtai-Linial
- Analysis of Boolean Functions
- Explicit two-source extractors and resilient functions
- Pseudorandom Generators with Long Stretch and Low Locality from Random Local One-Way Functions
- Design extractors, non-malleable condensers and privacy amplification
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Advances in Cryptology - CRYPTO 2003
- Extractors and pseudorandom generators
- On ε‐biased generators in NC0
- Cryptography in $NC^0$
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
This page was built for publication:
