Paper 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.
Metadata
- Available format(s)
- PS
- Category
- Cryptographic protocols
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- secret sharingmultiparty computation
- Contact author(s)
- rosario @ watson ibm com
- History
- 2003-04-10: revised
- 2003-03-31: received
- See all versions
- Short URL
- https://ia.cr/2003/057
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2003/057,
author = {Mario Di Raimondo and Rosario Gennaro},
title = {Secure Multiplication of Shared Secrets in the Exponent},
howpublished = {Cryptology {ePrint} Archive, Paper 2003/057},
year = {2003},
url = {https://eprint.iacr.org/2003/057}
}
