International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 01 April 2013

Jean-Sebastien Coron, Tancrede Lepoint, Mehdi Tibouchi
ePrint Report ePrint Report
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.

Expand

Additional news items may be found on the IACR news page.