Cryptanalysis of the Multilinear Map over the Integers
From MaRDI portal
Publication:2948321
DOI10.1007/978-3-662-46800-5_1zbMath1365.94416OpenAlexW3121827341MaRDI QIDQ2948321
Damien Stehlé, Kyoohyung Han, Hansol Ryu, Changmin Lee, Jung Hee Cheon
Publication date: 30 September 2015
Published in: Advances in Cryptology -- EUROCRYPT 2015 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-46800-5_1
Related Items
(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 ⋮ Return of GGH15: provable security against zeroizing attacks ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Survey of information security ⋮ Adaptive-secure identity-based inner-product functional encryption and its leakage-resilience ⋮ Bad Directions in Cryptographic Hash Functions ⋮ Cryptanalysis of candidate obfuscators for affine determinant programs ⋮ Optimal broadcast encryption and CP-ABE from evasive lattice assumptions ⋮ Cryptanalysis of multilinear maps from ideal lattices: revisited ⋮ From minicrypt to obfustopia via private-key functional encryption ⋮ Proofs of Work from worst-case assumptions ⋮ From FE combiners to secure MPC and back ⋮ Attribute based encryption for deterministic finite automata from DLIN ⋮ Algebraic generalization of Diffie-Hellman key exchange ⋮ The random oracle model: a twenty-year retrospective ⋮ Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs ⋮ Multilinear maps from obfuscation ⋮ On virtual grey box obfuscation for general circuits ⋮ Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin ⋮ On the security of functional encryption in the generic group model ⋮ Cryptanalysis of the CLT13 multilinear map ⋮ Witness encryption and null-iO from evasive LWE ⋮ Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \) ⋮ A survey on functional encryption ⋮ Lattice-based programmable hash functions and applications ⋮ Indistinguishability obfuscation ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Practical Order-Revealing Encryption with Limited Leakage ⋮ Obfuscating conjunctions ⋮ Efficient obfuscation for CNF circuits and applications in cloud computing ⋮ On the complexity of compressing obfuscation ⋮ Dual System Framework in Multilinear Settings and Applications to Fully Secure (Compact) ABE for Unbounded-Size Circuits ⋮ Constraining Pseudorandom Functions Privately ⋮ Zeroizing Attacks on Indistinguishability Obfuscation over CLT13 ⋮ Short Generators Without Quantum Computers: The Case of Multiquadratics ⋮ 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 ⋮ Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE ⋮ 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 ⋮ Algorithms for CRT-variant of approximate greatest common divisor problem ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ On the Correlation Intractability of Obfuscated Pseudorandom Functions ⋮ Multilinear Maps from Obfuscation ⋮ Cryptographic Assumptions: A Position Paper ⋮ How to build time-lock encryption ⋮ Functional Encryption Without Obfuscation ⋮ Contention in Cryptoland: Obfuscation, Leakage and UCE ⋮ Can PPAD hardness be based on standard cryptographic assumptions? ⋮ What is the Future of Cryptography? ⋮ Constrained pseudorandom functions from functional encryption ⋮ New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries ⋮ 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 ⋮ Combiners for functional encryption, unconditionally ⋮ Candidate obfuscation via oblivious LWE sampling ⋮ Shorter Circuit Obfuscation in Challenging Security Models ⋮ Obfuscation Combiners ⋮ Cryptanalysis of GGH15 Multilinear Maps ⋮ Circular Security Separations for Arbitrary Length Cycles from LWE ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ Constrained pseudorandom functions for Turing machines revisited: how to achieve verifiability and key delegation ⋮ Simultaneous diagonalization of incomplete matrices and applications ⋮ Separating Semantic and Circular Security for Symmetric-Key Bit Encryption from the Learning with Errors Assumption ⋮ Cryptanalyses of Candidate Branching Program Obfuscators
