We present a new protocol for the following task. Given two 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–HellmanAssumption holds). This results in a non-interactive and more efficient protocol.
Secure Multiplication of Shared Secrets in the Exponent
DI RAIMONDO, MARIO
2005-01-01
Abstract
We present a new protocol for the following task. Given two 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–HellmanAssumption holds). This results in a non-interactive and more efficient protocol.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
Secure multiplication of shared secrets in the exponent.pdf
solo gestori archivio
Tipologia:
Versione Editoriale (PDF)
Licenza:
Non specificato
Dimensione
129.1 kB
Formato
Adobe PDF
|
129.1 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.