Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
From MaRDI portal
Publication:2796115
DOI10.1007/978-3-662-49096-9_1zbMath1388.94075OpenAlexW2295700091MaRDI QIDQ2796115
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_1
Related Items (10)
The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO ⋮ Impossibility of order-revealing encryption in idealized models ⋮ Structure-preserving compilers from new notions of obfuscations ⋮ On the impossibility of purely algebraic signatures ⋮ On Removing Graded Encodings from Functional Encryption ⋮ On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models ⋮ Lower Bounds on Assumptions Behind Indistinguishability Obfuscation ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ On Statistically Secure Obfuscation with Approximate Correctness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On the Circular Security of Bit-Encryption
- Candidate Multilinear Maps from Ideal Lattices
- On Obfuscation with Random Oracles
- Obfuscating Circuits via Composite-Order Graded Encoding
- 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
This page was built for publication: Impossibility of VBB Obfuscation with Ideal Constant-Degree Graded Encodings
