Searching for ELFs in the cryptographic forest
From MaRDI portal
Publication:6582218
DOI10.1007/978-3-031-48621-0_8zbMATH Open1544.94241MaRDI QIDQ6582218
Publication date: 2 August 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Limits on the power of garbling techniques for public-key encryption
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- On distributional collision resistant hashing
- Extracting randomness from extractor-dependent sources
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- Targeted lossy functions and applications
- On the complexity of collision resistant hash functions: new and old black-box separations
- The magic of ELFs
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- Contention in Cryptoland: Obfuscation, Leakage and UCE
- The Magic of ELFs
- Instantiating Random Oracles via UCEs
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
- Lossy Functions Do Not Amplify Well
- Lossy Trapdoor Functions and Their Applications
- A complete problem for statistical zero knowledge
- Lossy trapdoor functions and their applications
- The knowledge complexity of interactive proof-systems
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology - CRYPTO 2003
- Instantiability of classical random-oracle-model encryption transforms
Related Items (1)
This page was built for publication: Searching for ELFs in the cryptographic forest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582218)
