On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
From MaRDI portal
Publication:2796117
DOI10.1007/978-3-662-49096-9_2zbMath1388.94071OpenAlexW2295912671MaRDI QIDQ2796117
Soheil Nematihaji, Ameer Mohammed, Mohammad Mahmoody
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_2
Related Items (9)
Impossibility of order-revealing encryption in idealized models ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ On the black-box impossibility of multi-designated verifiers signature schemes from ring signature schemes ⋮ On the impossibility of purely algebraic signatures ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ On Statistically Secure Obfuscation with Approximate Correctness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
- Lower Bounds on Assumptions Behind Indistinguishability Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- On Black-Box Reductions between Predicate Encryption Schemes
- The random oracle methodology, revisited
- On obfuscating point functions
- Candidate Multilinear Maps from Ideal Lattices
- On Obfuscation with Random Oracles
- Advances in Cryptology - EUROCRYPT 2004
- 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
- Theory of Cryptography
This page was built for publication: On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
