[Resource Topic] 2003/057: Secure Multiplication of Shared Secrets in the Exponent

Welcome to the resource topic for 2003/057

Secure Multiplication of Shared Secrets in the Exponent

Authors: Mario Di Raimondo, Rosario Gennaro


We present a new protocol for the following task. Given
tow secrets a,b shared among n players, compute the value

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.

ePrint: https://eprint.iacr.org/2003/057

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .