## CryptoDB

### Paper: Applications of Multilinear Forms to Cryptography

Authors: Dan Boneh Alice Silverberg URL: http://eprint.iacr.org/2002/080 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2002-11603,
title={Applications of Multilinear Forms to Cryptography},
booktitle={IACR Eprint archive},
keywords={},
url={http://eprint.iacr.org/2002/080},
note={to appear in the Proceedings of the Conferences in memory of Ruth Michler, Contemporary Mathematics, American Mathematical Society, Providence, RI silver@math.ohio-state.edu 11973 received 24 Jun 2002, last revised 13 Oct 2002},
author={Dan Boneh and Alice Silverberg},
year=2002
}