| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331939 | Information Processing Letters | 2005 | 9 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Rosario Gennaro, Mario Di Raimondo,