Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
From MaRDI portal
Publication:5111369
DOI10.4230/LIPICS.ICALP.2017.38zbMATH Open1441.94068OpenAlexW2741823356MaRDI QIDQ5111369FDOQ5111369
Authors: Daniel Apon, Nico Döttling, Sanjam Garg, Pratyay Mukherjee 
Publication date: 27 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/icalp/icalp2017.html#AponDGM17
Recommendations
- Implementing indistinguishability obfuscation using GGH15
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Cryptanalysis of the GGH cryptosystem
- Cryptanalyses of branching program obfuscations over GGH13 multilinear map from the NTRU problem
- Cryptanalysis of GGH15 multilinear maps
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- scientific article; zbMATH DE number 566341
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Cryptographic implications of Hess' generalized GHS attack
- Aggregated differentials and cryptanalysis of PP-1 and GOST
Cryptography (94A60) Data structures (68P05) Networks and circuits as models of computation; circuit complexity (68Q06)
Cited In (19)
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
- Implementing indistinguishability obfuscation using GGH15
- GGH15 beyond permutation branching programs: proofs, attacks, and candidates
- Collusion resistant traitor tracing from learning with errors
- Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
- On the complexity of compressing obfuscation
- Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- Attribute based encryption for deterministic finite automata from DLIN
- Obfustopia built on secret-key functional encryption
- Cryptanalysis of candidate obfuscators for affine determinant programs
- Candidate obfuscation via oblivious LWE sampling
- 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
- Constrained pseudorandom functions from functional encryption
- Witness encryption and null-iO from evasive LWE
- Preventing CLT attacks on obfuscation with linear overhead
This page was built for publication: Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111369)
