Welcome to the resource topic for 2002/080
Applications of Multilinear Forms to Cryptography
Authors: Dan Boneh, Alice SilverbergAbstract:
We study the problem of finding efficiently computable non-degenerate multilinear maps from G_1^n to G_2, where G_1 and G_2 are groups of the same prime order, and where computing discrete logarithms in G_1 is hard. We present several applications to cryptography, explore directions for building such maps, and give some reasons to believe that finding examples with n>2 may be difficult.
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 .