Welcome to the resource topic for 2013/183
Title:
Practical Multilinear Maps over the Integers
Authors: Jean-Sebastien Coron, Tancrede Lepoint, Mehdi Tibouchi
Abstract:Extending bilinear elliptic curve pairings to multilinear maps is a long-standing open problem. The first plausible construction of such multilinear maps has recently been described by Garg, Gentry and Halevi, based on ideal lattices. In this paper we describe a different construction that works over the integers instead of ideal lattices, similar to the DGHV fully homomorphic encryption scheme. We also describe a different technique for proving the full randomization of encodings: instead of Gaussian linear sums, we apply the classical leftover hash lemma over a quotient lattice. We show that our construction is relatively practical: for reasonable security parameters a one-round 7-party Diffie-Hellman key exchange requires about 25 seconds per party.
ePrint: https://eprint.iacr.org/2013/183
Talk: https://www.youtube.com/watch?v=oSmDcr7iG3A
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .