The Magic of ELFs
From MaRDI portal
Publication:2835598
DOI10.1007/978-3-662-53018-4_18zbMath1384.94112OpenAlexW2499653921MaRDI QIDQ2835598
Publication date: 30 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01621025/file/ABM-LWE-tight-SO-v3.pdf
Related Items (22)
Practical algorithm substitution attack on extractable signatures ⋮ The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security ⋮ Targeted lossy functions and applications ⋮ Leakage Resilient One-Way Functions: The Auxiliary-Input Setting ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Simpler constructions of asymmetric primitives from obfuscation ⋮ Fiat-Shamir and correlation intractability from strong KDM-secure encryption ⋮ Augmented random oracles ⋮ Lockable obfuscation from circularly insecure fully homomorphic encryption ⋮ Beyond Uber: instantiating generic groups via PGGs ⋮ Instantiability of classical random-oracle-model encryption transforms ⋮ Security-preserving distributed samplers: how to generate any CRS in one round without random oracles ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Leakage-resilient cryptography from puncturable primitives and obfuscation ⋮ KDM security for identity-based encryption: constructions and separations ⋮ Public-Seed Pseudorandom Permutations ⋮ Leakage resilient one-way functions: the auxiliary-input setting ⋮ Continuous verifiable delay functions ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Incompressible encodings ⋮ New constructions of hinting PRGs, OWFs with encryption, and more
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the Correlation Intractability of Obfuscated Pseudorandom Functions
- Cryptographic Assumptions: A Position Paper
- How to Avoid Obfuscation Using Witness PRFs
- Contention in Cryptoland: Obfuscation, Leakage and UCE
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
- Instantiating Random Oracles via UCEs
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- Point Obfuscation and 3-Round Zero-Knowledge
- Lossy Functions Do Not Amplify Well
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- How to Generate and Use Universal Samplers
- Efficient Pseudorandom Functions via On-the-Fly Adaptation
- Lossy trapdoor functions and their applications
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- On obfuscating point functions
- Correcting errors without leaking partial information
- Chosen-Ciphertext Security via Correlated Products
- Simultaneous Hardcore Bits and Cryptography against Memory Attacks
- Optimal Reductions of Some Decisional Problems to the Rank Problem
- Practical Signatures from Standard Assumptions
- On the existence of extractable one-way functions
- Replacing a Random Oracle: Full Domain Hash from Indistinguishability Obfuscation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- On Extractability Obfuscation
This page was built for publication: The Magic of ELFs
