Contention in Cryptoland: Obfuscation, Leakage and UCE
From MaRDI portal
Publication:2799108
DOI10.1007/978-3-662-49099-0_20zbMath1382.94062OpenAlexW2296754321MaRDI QIDQ2799108
Stefano Tessaro, Igors Stepanovs, Mihir Bellare
Publication date: 8 April 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49099-0_20
Related Items (11)
Strong Hardness of Privacy from Weak Traitor Tracing ⋮ Private Functional Encryption: Indistinguishability-Based Definitions and Constructions from Obfuscation ⋮ Augmented random oracles ⋮ Nonmalleable digital lockers and robust fuzzy extractors in the plain model ⋮ Modeling Random Oracles Under Unpredictable Queries ⋮ Public-Seed Pseudorandom Permutations ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ The magic of ELFs ⋮ The Magic of ELFs ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Point-Function Obfuscation: A Framework and Generic Constructions
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation
- Instantiating Random Oracles via UCEs
- Indistinguishability Obfuscation and UCEs: The Case of Computationally Unpredictable Sources
- Security Analysis of Multilinear Maps over the Integers
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input
- The Impossibility of Obfuscation with Auxiliary Input or a Universal Simulator
- On Virtual Grey Box Obfuscation for General Circuits
- Point Obfuscation and 3-Round Zero-Knowledge
- Poly-Many Hardcore Bits for Any One-Way Function and a Framework for Differing-Inputs Obfuscation
- Using Indistinguishability Obfuscation via UCEs
- Indistinguishability Obfuscation versus Multi-bit Point Obfuscation with Auxiliary Input
- Cryptanalysis of the Multilinear Map over the Integers
- A Formal Treatment of Backdoored Pseudorandom Generators
- Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- On Symmetric Encryption and Point Obfuscation
- Robust Encryption
- On obfuscating point functions
- On Strong Simulation and Composable Point Obfuscation
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- A Pseudorandom Generator from any One-way Function
- On cryptography with auxiliary input
- How to use indistinguishability obfuscation
- On the existence of extractable one-way functions
- Random-Oracle Uninstantiability from Indistinguishability Obfuscation
- Chosen Ciphertext Security via UCE
- Protecting Obfuscation against Algebraic Attacks
- On the impossibility of approximate obfuscation and applications to resettable cryptography
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On Extractability Obfuscation
This page was built for publication: Contention in Cryptoland: Obfuscation, Leakage and UCE
