Cryptology ePrint Archive: Report 2003/057

Secure Multiplication of Shared Secrets in the Exponent

Mario Di Raimondo and Rosario Gennaro

Abstract: 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.

Category / Keywords: cryptographic protocols / secret sharing, multiparty computation

Date: received 31 Mar 2003, last revised 10 Apr 2003

Contact author: rosario at watson ibm com

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | BibTeX Citation

Version: 20030410:154735 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]