Cryptanalysis of the New CLT Multilinear Map over the Integers
From MaRDI portal
Publication:2820495
DOI10.1007/978-3-662-49890-3_20zbMath1385.94020OpenAlexW2470510195MaRDI QIDQ2820495
Jung Hee Cheon, Brice Minaud, Changmin Lee, Hansol Ryu, Pierre-Alain Fouque
Publication date: 9 September 2016
Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_20
Related Items
The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Cryptanalysis of multilinear maps from ideal lattices: revisited ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Multilinear maps from obfuscation ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ On the security of functional encryption in the generic group model ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero ⋮ Public key encryption with equality test from generic assumptions in the random oracle model ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Constraining Pseudorandom Functions Privately ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ From Minicrypt to Obfustopia via Private-Key Functional Encryption ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Functional encryption for cascade automata ⋮ 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 ⋮ Cryptanalysis of GGH15 Multilinear Maps ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation
