Candidate Multilinear Maps and Applications

NOTE SPECIAL MEETING TIME!
In this talk, I will describe plausible lattice-based constructions with properties that approximate the sought-after multilinear maps in hard-discrete-logarithm groups. I will show some applications of such multilinear maps. 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.
(Based on joint works with Craig Gentry and Shai Halevi and Craig Gentry, Amit Sahai and Brent Waters)