Paper 2015/463

Multilinear Maps Using Random Matrix

Gu Chunsheng

Abstract

Garg, Gentry and Halevi (GGH) described the first candidate multilinear maps using ideal lattices. However, Hu and Jia presented an efficient attack on GGH map, which breaks the GGH-based applications of multipartite key exchange (MPKE) and witness encryption (WE) based on the hardness of 3-exact cover problem. We describe a new construction of multilinear map using random matrix, which supports the applications for public tools of encoding in the origin GGH, such as MPKE and WE. The security of our construction depends upon new hardness assumption. Furthermore, our construction removes the special structure of the ring element in the principal ideal lattice problem, and avoids potential attacks generated by algorithm of solving short principal ideal lattice generator.

Metadata
Available format(s)
-- withdrawn --
Publication info
Preprint. MINOR revision.
Keywords
Multilinear mapsIdeal latticesMultipartite Diffie-Hellman key exchangeWitness encryptionZeroizing attack
Contact author(s)
chunsheng_gu @ 163 com
History
2015-12-14: withdrawn
2015-05-15: received
See all versions
Short URL
https://ia.cr/2015/463
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.