Advances in Cryptology – EUROCRYPT 2013

Volume 7881 of the series Lecture Notes in Computer Science pp 1-17

Candidate Multilinear Maps from Ideal Lattices

  • Sanjam GargAffiliated withUCLA
  • , Craig GentryAffiliated withIBM Research
  • , Shai HaleviAffiliated withIBM Research

* Final gross prices may vary according to local VAT.

Get Access


We describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups, and show an example application of such multi-linear maps that can be realized using our approximation. The security of our constructions relies on seemingly hard problems in ideal lattices, which can be viewed as extensions of the assumed hardness of the NTRU function.