## CryptoDB

### Paper: Secure Multiplication of Shared Secrets in the Exponent

Authors: Mario Di Raimondo Rosario Gennaro URL: http://eprint.iacr.org/2003/057 Search ePrint Search Google We present a new protocol for the following task. Given tow secrets a,b shared among n players, compute the value g^{ab}. The protocol uses the generic BGW approach for multiplication of shared secrets, but we show that if one is computing multiplications in the exponent'' the polynomial randomization step can be avoided (assuming the Decisional Diffie-Hellman Assumption holds). This results in a non-interactive and more efficient protocol.
##### BibTeX
@misc{eprint-2003-11774,
title={Secure Multiplication of Shared Secrets in the Exponent},
booktitle={IACR Eprint archive},
keywords={cryptographic protocols / secret sharing, multiparty computation},
url={http://eprint.iacr.org/2003/057},
note={ rosario@watson.ibm.com 12152 received 31 Mar 2003, last revised 10 Apr 2003},
author={Mario Di Raimondo and Rosario Gennaro},
year=2003
}