You are looking at a specific version 20021013:220501 of this paper.
See the latest version.
Paper 2002/080
Applications of Multilinear Forms to Cryptography
Dan Boneh and Alice Silverberg
Abstract
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.
Metadata
- Available format(s)
-
PDF
PS
- Publication info
- Published elsewhere. to appear in the Proceedings of the Conferences in memory of Ruth Michler, Contemporary Mathematics, American Mathematical Society, Providence, RI
- Contact author(s)
- silver @ math ohio-state edu
- History
- 2018-04-30: last of 2 revisions
- 2002-06-24: received
- See all versions
- Short URL
- https://ia.cr/2002/080
- License
-
CC BY
