You are looking at a specific version 20150224:140551 of this paper.
See the latest version.
Paper 2014/906
Cryptanalysis of the Multilinear Map over the Integers
Jung Hee Cheon and Kyoohyung Han and Changmin Lee and Hansol Ryu and Damien Stehle
Abstract
We describe a polynomial-time cryptanalysis of the (approximate) multilinear map of Coron, Lepoint and Tibouchi (CLT). The attack relies on an adaptation of the so-called zeroizing attack against the Garg, Gentry and Halevi (GGH) candidate multilinear map. Zeroizing is much more devastating for CLT than for GGH. In the case of GGH, it allows to break generalizations of the Decision Linear and Subgroup Membership problems from pairing-based cryptography. For CLT, this leads to a total break: all quantities meant to be kept secret can be efficiently and publicly recovered.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Multilinear mapsgraded encoding schemes.
- Contact author(s)
- damien stehle @ gmail com
- History
- 2017-09-15: last of 6 revisions
- 2014-11-03: received
- See all versions
- Short URL
- https://ia.cr/2014/906
- License
-
CC BY