New Multilinear Maps Over the Integers

DOI10.1007/978-3-662-47989-6_13zbMath1375.94116OpenAlexW1915197037MaRDI QIDQ3457114

Mehdi Tibouchi, Jean-Sébastien Coron, Tancrède Lepoint

Publication date: 10 December 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47989-6_13

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (41)

One-Way Functions and (Im)perfect Obfuscation ⋮ Towards faster polynomial-time lattice reduction ⋮ Cutting-edge cryptography through the lens of secret sharing ⋮ The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks ⋮ Delegating RAM Computations with Adaptive Soundness and Privacy ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Cryptanalysis of multilinear maps from ideal lattices: revisited ⋮ Proofs of Work from worst-case assumptions ⋮ New approaches to traitor tracing with embedded identities ⋮ The random oracle model: a twenty-year retrospective ⋮ Multilinear maps from obfuscation ⋮ On virtual grey box obfuscation for general circuits ⋮ Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications ⋮ 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} \) ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing ⋮ An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero ⋮ 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 ⋮ Short Generators Without Quantum Computers: The Case of Multiquadratics ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Functional encryption for cascade automata ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Multilinear Maps from Obfuscation ⋮ Perfect Structure on the Edge of Chaos ⋮ How to build time-lock encryption ⋮ Cutting-Edge Cryptography Through the Lens of Secret Sharing ⋮ Functional Encryption Without Obfuscation ⋮ 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 ⋮ Shorter Circuit Obfuscation in Challenging Security Models ⋮ Cryptanalysis of GGH15 Multilinear Maps ⋮ Revisiting orthogonal lattice attacks on approximate common divisor problems

Cites Work

• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Practical Multilinear Maps over the Integers
• Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers
• Implementing Gentry’s Fully-Homomorphic Encryption Scheme
• Fully Homomorphic Encryption over the Integers
• Candidate Multilinear Maps from Ideal Lattices

This page was built for publication: New Multilinear Maps Over the Integers