New Multilinear Maps Over the Integers
From MaRDI portal
Publication:3457114
DOI10.1007/978-3-662-47989-6_13zbMath1375.94116MaRDI 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
94A60: Cryptography
Related Items
Practical Order-Revealing Encryption with Limited Leakage, 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, One-Way Functions and (Im)perfect Obfuscation, Witness encryption and null-iO from evasive LWE, Obfuscating conjunctions, The random oracle model: a twenty-year retrospective, Cutting-edge cryptography through the lens of secret sharing, The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks, Proofs of Work from worst-case assumptions, On virtual grey box obfuscation for general circuits, Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications, Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing, How to build time-lock encryption, Efficient obfuscation for CNF circuits and applications in cloud computing, Functional encryption for cascade automata, New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries, Revisiting orthogonal lattice attacks on approximate common divisor problems, Towards faster polynomial-time lattice reduction, New approaches to traitor tracing with embedded identities, Multilinear maps from obfuscation, Constrained pseudorandom functions from functional encryption, Cryptanalysis of multilinear maps from ideal lattices: revisited, Cryptanalysis of the CLT13 multilinear map, Indistinguishability Obfuscation: From Approximate to Exact, Multilinear Maps from Obfuscation, Perfect Structure on the Edge of Chaos, Cutting-Edge Cryptography Through the Lens of Secret Sharing, Functional Encryption Without Obfuscation, Generalized Hardness Assumption for Self-bilinear Map with Auxiliary Information, Shorter Circuit Obfuscation in Challenging Security Models, Cryptanalysis of GGH15 Multilinear Maps, An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero, Delegating RAM Computations with Adaptive Soundness and Privacy, Secure Obfuscation in a Weak Multilinear Map Model, Compactness vs Collusion Resistance in Functional Encryption
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
