Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13

DOI10.1007/978-3-662-53008-5_22zbMath1391.94782OpenAlexW2500250645MaRDI QIDQ2829233

Mark Zhandry, Amit Sahai, Eric Miles

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

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

One-Way Functions and (Im)perfect Obfuscation, (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, Strong Hardness of Privacy from Weak Traitor Tracing, Delegating RAM Computations with Adaptive Soundness and Privacy, Secure Obfuscation in a Weak Multilinear Map Model, Anonymous IBE, leakage resilience and circular security from new assumptions, Towards breaking the exponential barrier for general secret sharing, Cryptanalysis of candidate obfuscators for affine determinant programs, Optimal broadcast encryption and CP-ABE from evasive lattice assumptions, From minicrypt to obfustopia via private-key functional encryption, Proofs of Work from worst-case assumptions, Attribute based encryption for deterministic finite automata from DLIN, Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs, Multilinear maps from obfuscation, Multi-input Functional Encryption with Unbounded-Message Security, (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin, Witness encryption and null-iO from evasive LWE, Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \), CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case, Indistinguishability obfuscation, One-Round Cross-Domain Group Key Exchange Protocol in the Standard Model, Collusion Resistant Traitor Tracing from Learning with Errors, Efficient obfuscation for CNF circuits and applications in cloud computing, On the complexity of compressing obfuscation, Zeroizing Attacks on Indistinguishability Obfuscation over CLT13, Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption, From Minicrypt to Obfustopia via Private-Key Functional Encryption, Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps, On Removing Graded Encodings from Functional Encryption, Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions, Functional encryption for cascade automata, Candidate iO from homomorphic encryption schemes, Obfustopia built on secret-key functional encryption, Can PPAD hardness be based on standard cryptographic assumptions?, Constrained pseudorandom functions from functional encryption, Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information, Optimal broadcast encryption from pairings and LWE, Candidate iO from homomorphic encryption schemes, Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE, Candidate obfuscation via oblivious LWE sampling, Shorter Circuit Obfuscation in Challenging Security Models, Obfuscation Combiners, Cryptanalysis of GGH15 Multilinear Maps, Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation, The Complexity of Public-Key Cryptography, Cryptanalyses of Candidate Branching Program Obfuscators

Cites Work