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

From MaRDI portal
Publication:2829233

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




Related Items (47)

One-Way Functions and (Im)perfect Obfuscation(In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear mapsThe MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacksStrong Hardness of Privacy from Weak Traitor TracingDelegating RAM Computations with Adaptive Soundness and PrivacySecure Obfuscation in a Weak Multilinear Map ModelAnonymous IBE, leakage resilience and circular security from new assumptionsTowards breaking the exponential barrier for general secret sharingCryptanalysis of candidate obfuscators for affine determinant programsOptimal broadcast encryption and CP-ABE from evasive lattice assumptionsFrom minicrypt to obfustopia via private-key functional encryptionProofs of Work from worst-case assumptionsAttribute based encryption for deterministic finite automata from DLINMultiparty noninteractive key exchange from ring key-homomorphic weak PRFsMultilinear maps from obfuscationMulti-input Functional Encryption with Unbounded-Message Security(Compact) adaptively secure FE for attribute-weighted sums from \(k\)-linWitness encryption and null-iO from evasive LWEPolynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear CaseIndistinguishability obfuscationOne-Round Cross-Domain Group Key Exchange Protocol in the Standard ModelCollusion Resistant Traitor Tracing from Learning with ErrorsEfficient obfuscation for CNF circuits and applications in cloud computingOn the complexity of compressing obfuscationZeroizing Attacks on Indistinguishability Obfuscation over CLT13Robust Transforming Combiners from Indistinguishability Obfuscation to Functional EncryptionFrom Minicrypt to Obfustopia via Private-Key Functional EncryptionProjective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear MapsOn Removing Graded Encodings from Functional EncryptionFunctional Encryption: Deterministic to Randomized Functions from Simple AssumptionsFunctional encryption for cascade automataCandidate iO from homomorphic encryption schemesObfustopia built on secret-key functional encryptionCan PPAD hardness be based on standard cryptographic assumptions?Constrained pseudorandom functions from functional encryptionGeneralized Hardness Assumption for Self-bilinear Map with Auxiliary InformationOptimal broadcast encryption from pairings and LWECandidate iO from homomorphic encryption schemesIndistinguishability obfuscation without maps: attacks and fixes for noisy linear FECandidate obfuscation via oblivious LWE samplingShorter Circuit Obfuscation in Challenging Security ModelsObfuscation CombinersCryptanalysis of GGH15 Multilinear MapsConstrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegationThe Complexity of Public-Key CryptographyCryptanalyses of Candidate Branching Program Obfuscators



Cites Work


This page was built for publication: Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13