Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
From MaRDI portal
Publication:2829233
DOI10.1007/978-3-662-53008-5_22zbMATH Open1391.94782OpenAlexW2500250645MaRDI QIDQ2829233FDOQ2829233
Authors: Eric Miles, Amit Sahai, Mark Zhandry 
Publication date: 27 October 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53008-5_22
Recommendations
- Cryptanalysis of GGH15 multilinear maps
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Statistical zeroizing attack: cryptanalysis of candidates of BP obfuscation over GGH15 multilinear map
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Cryptanalyses of branching program obfuscations over GGH13 multilinear map from the NTRU problem
- Cryptanalysis of the CLT13 multilinear map
- Cryptanalysis of the multilinear map over the integers
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- Cryptanalysis of multilinear maps from ideal lattices: revisited
- Cryptanalysis of CLT13 multilinear maps with independent slots
Cites Work
- Practical multilinear maps over the integers
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Candidate Multilinear Maps from Ideal Lattices
- Cryptanalysis of GGH map
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Virtual Black-Box Obfuscation for All Circuits via Generic Graded Encoding
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Indistinguishability obfuscation from semantically-secure multilinear encodings
- Semantically secure order-revealing encryption: multi-input functional encryption without obfuscation
- 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
- Protecting obfuscation against algebraic attacks
- Recovering short generators of principal ideals in cyclotomic rings
- Post-zeroizing obfuscation: new mathematical tools, and the case of evasive circuits
Cited In (54)
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Generalized hardness assumption for self-bilinear map with auxiliary information
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- On Removing Graded Encodings from Functional Encryption
- Candidate iO from homomorphic encryption schemes
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Functional encryption for cascade automata
- Return of GGH15: provable security against zeroizing attacks
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- Strong hardness of privacy from weak traitor tracing
- Anonymous IBE, leakage resilience and circular security from new assumptions
- Towards breaking the exponential barrier for general secret sharing
- Multilinear maps from obfuscation
- Cryptanalysis of GGH15 multilinear maps
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- Multi-input functional encryption with unbounded-message security
- On the statistical leak of the GGH13 multilinear map and some variants
- Delegating RAM computations with adaptive soundness and privacy
- From Minicrypt to Obfustopia via private-key functional encryption
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Collusion resistant traitor tracing from learning with errors
- From minicrypt to obfustopia via private-key functional encryption
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- Can PPAD hardness be based on standard cryptographic assumptions?
- On the complexity of compressing obfuscation
- Attribute based encryption for deterministic finite automata from DLIN
- Functional encryption: deterministic to randomized functions from simple assumptions
- Obfustopia built on secret-key functional encryption
- One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Candidate iO from homomorphic encryption schemes
- Optimal broadcast encryption from pairings and LWE
- Candidate obfuscation via oblivious LWE sampling
- Secure Obfuscation in a Weak Multilinear Map Model
- Proofs of Work from worst-case assumptions
- Shorter circuit obfuscation in challenging security models
- Obfuscation combiners
- Cryptanalyses of branching program obfuscations over GGH13 multilinear map from the NTRU problem
- Quantum attacks against indistinguishablility obfuscators proved secure in the weak multilinear map model
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE
- The Complexity of Public-Key Cryptography
- Constrained pseudorandom functions from functional encryption
- Witness encryption and null-iO from evasive LWE
- One-Way Functions and (Im)perfect Obfuscation
- Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
- Cryptanalyses of Candidate Branching Program Obfuscators
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
- Two-round concurrent 2PC from sub-exponential LWE
- Indistinguishability obfuscation
- Time-lock puzzles from lattices
This page was built for publication: Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829233)
