Expander-Based Cryptography Meets Natural Proofs
From MaRDI portal
Publication:5090391
DOI10.4230/LIPIcs.ITCS.2019.18OpenAlexW2945088997MaRDI QIDQ5090391
Roei Tell, Rahul Santhanam, Oliveira Igor Carboni
Publication date: 18 July 2022
Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2018/10111/pdf/LIPIcs-ITCS-2019-18.pdf
Cites Work
- Unnamed Item
- A dichotomy for local small-bias generators
- Cryptographic hardness of random local functions. Survey
- More on average case vs approximation complexity
- On the security of Goldreich's one-way function
- Cryptography in constant parallel time
- Pseudorandom bits for constant depth circuits
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Local expanders
- Input locality and hardness amplification
- Threshold circuits of bounded depth
- Lossless condensers, unbalanced expanders, and extractors
- The Complexity of DNF of Parities
- On the One-Way Function Candidate Proposed by Goldreich
- Public-key cryptography from different assumptions
- On the Complexity of Random Satisfiability Problems with Planted Solutions
- Candidate One-Way Functions Based on Expander Graphs
- Constant depth circuits, Fourier transform, and learnability
- Fast Pseudorandom Functions Based on Expander Graphs
- Unbalanced expanders and randomness extractors from Parvaresh--Vardy codes
- Randomness conductors and constant-degree lossless expanders
- Algebraic Attacks against Random Local Functions and Their Countermeasures
- Learning algorithms from natural proofs
- On ε‐biased generators in NC0
- Cryptography in $NC^0$
- Natural proofs
This page was built for publication: Expander-Based Cryptography Meets Natural Proofs
