Candidate Multilinear Maps from Ideal Lattices and Applications.
Sanjam Garg, Craig Gentry, Shai Halevi · 2012
We describe plausible lattice-based constructions with properties that approximate the soughtafter 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.