Speaker:
Sanjam Garg
Institution:
UCLA
Time:
Tuesday, May 7, 2013 - 3:00pm
Host:
Location:
RH 340N
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 multilinear 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. This is joint work with Craig Gentry and Shai Halevi.