1. What contributions have the authors mentioned in the paper "Zeroizing without low-level zeroes: new mmap attacks and their limitations" ?
Cheon et al. this paper showed that it is possible to zeroize without low-level zeroes.
read more
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Jean-Sébastien Coron,Craig Gentry,Shai Halevi,Tancrède Lepoint,Hemanta K. Maji,Hemanta K. Maji,Eric Miles,Mariana Raykova,Amit Sahai,Mehdi Tibouchi +9 more
- 16 Aug 2015
- pp 247-266
TL;DR: Cheon, Han, Lee, Ryu and Stehle as mentioned in this paper extended the zeroizing attacks of Eurocrypt 2015 on multilinear maps to settings where no encodings of zero below the maximal level are available.
read more
Abstract: We extend the recent zeroizing attacks of Cheon, Han, Lee, Ryu and Stehle (Eurocrypt’15) on multilinear maps to settings where no encodings of zero below the maximal level are available. Some of the new attacks apply to the CLT13 scheme (resulting in a total break) while others apply to (a variant of) the GGH13 scheme (resulting in a weak-DL attack). We also note the limits of these zeroizing attacks.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Most frequently asked questions
Citations
•Posted Content
A Decade of Lattice Cryptography.
TL;DR: Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems as mentioned in this paper, which is the main feature of lattice cryptography.
•Book
A Decade of Lattice Cryptography
Chris Peikert
- 07 Mar 2016
TL;DR: Lattice-based cryptography is the use of conjectured hard problems on point lattices in Rn as the foundation for secure cryptographic systems as discussed by the authors, which is the main feature of lattice cryptography.
Practical Order-Revealing Encryption with Limited Leakage
Nathan Chenette,Kevin Lewi,Stephen A. Weis,David J. Wu +3 more
- 20 Mar 2016
TL;DR: This work builds efficiently implementable order-revealing encryption from pseudorandom functions and presents the first efficient order- Revealing encryption scheme which achieves a simulation-based security notion with respect to a leakage function that precisely quantifies what is leaked by the scheme.
Cryptanalysis of the New CLT Multilinear Map over the Integers
Jung Hee Cheon,Pierre-Alain Fouque,Changmin Lee,Brice Minaud,Hansol Ryu +4 more
- 08 May 2016
TL;DR: Two polynomial attacks on the CLT15 multilinear map are presented, which share ideas similar to the cryptanalysis of CLT13 and allow recovery of all secret parameters in timePolynomial in the security parameter, and lead to a full break of theCLT15 multi-million-dollar map for virtually all applications.
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
Eric Miles,Amit Sahai,Mark Zhandry +2 more
- 14 Aug 2016
TL;DR: Using annihilation attacks, this work gives the first polynomial-time cryptanalysis of candidate iO schemes over GGH13, and exhibits two simple programs that are functionally equivalent, and shows how to efficiently distinguish between the obfuscations of these two programs.
References
Candidate Indistinguishability Obfuscation and Functional Encryption for all Circuits
Sanjam Garg,Craig Gentry,Shai Halevi,Mariana Raykova,Amit Sahai,Brent Waters +5 more
- 26 Oct 2013
TL;DR: In this paper, the authors studied indistinguishability obfuscation and functional encryption for general circuits, and gave constructions for the two schemes that support all polynomial-size circuits.
Candidate Multilinear Maps from Ideal Lattices
Sanjam Garg,Craig Gentry,Shai Halevi +2 more
- 26 May 2013
TL;DR: This work describes plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups, and shows an example application of such multi-linear maps that can be realized using the approximation.
Practical Multilinear Maps over the Integers
Jean-Sébastien Coron,Tancrède Lepoint,Mehdi Tibouchi +2 more
- 18 Aug 2013
TL;DR: A different construction that works over the integers instead of ideal lattices, similar to the DGHV fully homomorphic encryption scheme, and a different technique for proving the full randomization of encodings, using the classical leftover hash lemma over a quotient lattice.
Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
TL;DR: This work gives constructions for indistinguishability obfuscation and functional encryption that supports all polynomial-size circuits and describes a candidate construction for blurry obfuscation for $\mathbf{NC}^1$ circuits.
Cryptanalysis of the Multilinear Map over the Integers
Jung Hee Cheon,Kyoohyung Han,Changmin Lee,Hansol Ryu,Damien Stehlé +4 more
- 26 Apr 2015
TL;DR: A polynomial-time cryptanalysis of the approximate multilinear map of Coron, Lepoint and Tibouchi (CLT) is described in this paper.
Related Papers (5)
Sanjam Garg,Craig Gentry,Shai Halevi +2 more
- 26 May 2013
Jean-Sébastien Coron,Tancrède Lepoint,Mehdi Tibouchi +2 more
- 18 Aug 2013
Craig Gentry,Sergey Gorbunov,Shai Halevi +2 more
- 23 Mar 2015