Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
From MaRDI portal
Publication:2796118
DOI10.1007/978-3-662-49096-9_3zbMath1388.94072OpenAlexW2296310425MaRDI QIDQ2796118
Rafael Pass, Mohammad Mahmoody, Ameer Mohammed, Abhi Shelat, Soheil Nematihaji
Publication date: 23 March 2016
Published in: Theory of Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49096-9_3
Related Items (8)
Impossibility of simulation secure functional encryption even with random oracles ⋮ Proofs of Work from worst-case assumptions ⋮ On the complexity of compressing obfuscation ⋮ On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models ⋮ Minicrypt primitives with algebraic structure and applications ⋮ On Statistically Secure Obfuscation with Approximate Correctness ⋮ On succinct arguments and witness encryption from groups ⋮ Black-box use of one-way functions is useless for optimal fair coin-tossing
Cites Work
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
- On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
- On the power of nonuniformity in proofs of security
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- A Pseudorandom Generator from any One-way Function
- Designing programs that check their work
- Identity-Based Encryption from the Weil Pairing
- Candidate Multilinear Maps from Ideal Lattices
- Fully homomorphic encryption using ideal lattices
- How to use indistinguishability obfuscation
- On the (im)possibility of obfuscating programs
- Protecting Obfuscation against Algebraic Attacks
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Limits of provable security from standard assumptions
- Advances in Cryptology - CRYPTO 2003
- Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- On lattices, learning with errors, random linear codes, and cryptography
- Theory of Cryptography
This page was built for publication: Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
