Expander-Based Cryptography Meets Natural Proofs
From MaRDI portal
Recommendations
- Expander-based cryptography meets natural proofs
- Efficient proofs of retrievability using expander codes
- Advances in Cryptology - CRYPTO 2003
- Natural sd-RCCA secure public-key encryptions
- Programming Languages and Systems
- Provably secure self-extractable encryption
- scientific article; zbMATH DE number 2009957
Cites work
- A dichotomy for local small-bias generators
- Algebraic attacks against random local functions and their countermeasures
- Candidate one-way functions based on expander graphs
- Constant depth circuits, Fourier transform, and learnability
- Cryptographic hardness of random local functions. Survey
- Cryptography in NC^0
- Cryptography in constant parallel time
- Fast pseudorandom functions based on expander graphs
- Input locality and hardness amplification
- Learning algorithms from natural proofs
- Local expanders
- Lossless condensers, unbalanced expanders, and extractors
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- More on average case vs approximation complexity
- Natural proofs
- On the complexity of random satisfiability problems with planted solutions (extended abstract)
- On the one-way function candidate proposed by Goldreich
- On the security of Goldreich's one-way function
- On ε‐biased generators in NC0
- Pseudorandom bits for constant depth circuits
- Public-key cryptography from different assumptions
- Randomness conductors and constant-degree lossless expanders
- The complexity of DNF of parities
- Threshold circuits of bounded depth
- Tight bounds on the Fourier spectrum of \(\mathsf{AC}^0\)
- Unbalanced expanders and randomness extractors from Parvaresh-Vardy codes
Cited in
(4)
This page was built for publication: Expander-Based Cryptography Meets Natural Proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090391)
