Cryptanalyses of Candidate Branching Program Obfuscators
From MaRDI portal
Publication:5270365
DOI10.1007/978-3-319-56617-7_10zbMath1415.94418OpenAlexW2613927477MaRDI QIDQ5270365
Shai Halevi, Yilei Chen, Craig Gentry
Publication date: 23 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-56617-7_10
Related Items (20)
(In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Constructions for quantum indistinguishability obfuscation ⋮ Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions ⋮ Proofs of Work from worst-case assumptions ⋮ Matrix PRFs: constructions, attacks, and applications to obfuscation ⋮ Witness encryption and null-iO from evasive LWE ⋮ On the complexity of compressing obfuscation ⋮ Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ Candidate iO from homomorphic encryption schemes ⋮ How to build time-lock encryption ⋮ Obfustopia built on secret-key functional encryption ⋮ Constrained pseudorandom functions from functional encryption ⋮ Candidate iO from homomorphic encryption schemes ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Candidate obfuscation via oblivious LWE sampling
Cites Work
- Unnamed Item
- Unnamed Item
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Functional Encryption Without Obfuscation
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Indistinguishability Obfuscation from Constant-Degree Graded Encoding Schemes
- Cryptanalysis of GGH15 Multilinear Maps
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Practical Multilinear Maps over the Integers
- Indistinguishability Obfuscation from Semantically-Secure Multilinear Encodings
- Subexponential class group and unit group computation in large degree number fields
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Cryptanalysis of the Multilinear Map over the Integers
- How to Obfuscate Programs Directly
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Secure Obfuscation in a Weak Multilinear Map Model
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability Obfuscation from Compact Functional Encryption
- Trapdoors for hard lattices and new cryptographic constructions
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields
- Candidate Multilinear Maps from Ideal Lattices
- Graph-Induced Multilinear Maps from Lattices
- Obfuscating Circuits via Composite-Order Graded Encoding
- Protecting Obfuscation against Algebraic Attacks
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Recovering Short Generators of Principal Ideals in Cyclotomic Rings
- Post-zeroizing Obfuscation: New Mathematical Tools, and the Case of Evasive Circuits
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
This page was built for publication: Cryptanalyses of Candidate Branching Program Obfuscators
