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 multi-linear 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. © 2013 International Association for Cryptologic Research.
Cite
CITATION STYLE
Garg, S., Gentry, C., & Halevi, S. (2013). Candidate multilinear maps from ideal lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7881 LNCS, pp. 1–17). https://doi.org/10.1007/978-3-642-38348-9_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
