IACR News item: 29 October 2012
Sanjam Garg, Craig Gentry, Shai Halevi
ePrint Report
We describe plausible lattice-based constructions with properties that
approximate the sought-after multilinear maps in hard-discrete-logarithm
groups, and show that some applications of such multi-linear maps can
be realized using our approximations.
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.
Additional news items may be found on the IACR news page.