Welcome to the resource topic for 2012/610
Title:
Candidate Multilinear Maps from Ideal Lattices
Authors: Sanjam Garg, Craig Gentry, Shai Halevi
Abstract: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.
ePrint: https://eprint.iacr.org/2012/610
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .