We describe plausible lattice-based constructions with properties that
approximate the sought-after multilinear maps in hard-discrete-logarithm
groups. 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.
*Joint work with Sanjam Garg and Craig Gentry