Separating pseudorandom codes from local oracles
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology – CRYPTO 2004
- Analysis of Boolean Functions
- Black box crypto is useless for doubly efficient PIR
- Efficient noise-tolerant learning from statistical queries
- How (not) to build quantum PKE in Minicrypt
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- scientific article; zbMATH DE number 176554 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1024063 (Why is no real title available?)
- scientific article; zbMATH DE number 3052523 (Why is no real title available?)
- Inequalities in Fourier analysis
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- On black-box separations among injective one-way functions
- On the black-box complexity of correlation intractability
- On the Impossibility of Basing Public-Coin One-Way Permutations on Trapdoor Permutations
- On the impossibility of key agreements from quantum random oracles
- Pseudorandom error-correcting codes
- Public-key encryption, local pseudorandom generators, and the low-degree method
- Searching for ELFs in the cryptographic forest
- The curious case of non-interactive commitments -- on the power of black-box vs. non-black-box use of primitives
- Étude des coefficients de Fourier des fonctions de \(L^ p(G)\)
This page was built for publication: Separating pseudorandom codes from local oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233233)
