Candidate Multilinear Maps from Ideal Lattices

  • Sanjam Garg
  • Craig Gentry
  • Shai Halevi
Conference paper

DOI: 10.1007/978-3-642-38348-9_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7881)
Cite this paper as:
Garg S., Gentry C., Halevi S. (2013) Candidate Multilinear Maps from Ideal Lattices. In: Johansson T., Nguyen P.Q. (eds) Advances in Cryptology – EUROCRYPT 2013. EUROCRYPT 2013. Lecture Notes in Computer Science, vol 7881. Springer, Berlin, Heidelberg

Abstract

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.

Download to read the full conference paper text

Copyright information

© International Association for Cryptologic Research 2013

Authors and Affiliations

  • Sanjam Garg
    • 1
  • Craig Gentry
    • 2
  • Shai Halevi
    • 2
  1. 1.UCLAUSA
  2. 2.IBM ResearchUSA

Personalised recommendations