Searching for ELFs in the cryptographic forest

DOI10.1007/978-3-031-48621-0_8MaRDI QIDQ6582218zbMATH OpenFDO

Authors Marc Fischlin, Felix Rohrbach

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48621-0_8

zbMATH Keywords

extremely lossy functionhardcore functionspoint obfuscationrandom oracle instantiation

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The Magic of ELFs
• The magic of ELFs
• Regularly lossy functions and applications
• On ELFs, deterministic encryption, and correlated-input security
• Targeted lossy functions and applications

Cites work

• A complete problem for statistical zero knowledge
• A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology – CRYPTO 2004
• Contention in cryptoland: obfuscation, leakage and UCE
• Extracting randomness from extractor-dependent sources
• scientific article; zbMATH DE number 1303133 (Why is no real title available?)
• scientific article; zbMATH DE number 1775406 (Why is no real title available?)
• scientific article; zbMATH DE number 4185033 (Why is no real title available?)
• Indistinguishability obfuscation and UCEs: the case of computationally unpredictable sources
• Instantiability of classical random-oracle-model encryption transforms
• Instantiating random oracles via UCEs
• Limits on the power of garbling techniques for public-key encryption
• Lossy functions do not amplify well
• Lossy trapdoor functions and their applications
• Lossy Trapdoor Functions and Their Applications
• On distributional collision resistant hashing
• On the complexity of collision resistant hash functions: new and old black-box separations
• On the correlation intractability of obfuscated pseudorandom functions
• Shorter quasi-adaptive NIZK proofs for linear subspaces
• Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
• Targeted lossy functions and applications
• The knowledge complexity of interactive proof-systems
• The magic of ELFs
• The Magic of ELFs
• The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO

Cited in

(3)

• Lossy cryptography from code-based assumptions
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK
• Separating pseudorandom codes from local oracles

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)