About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Information Processing Letters
Paper
Secure multiplication of shared secrets in the exponent
Abstract
We present a new protocol for the following task. Given two secrets a, b shared among n players, compute the value gab. The protocol uses the generic BOW 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. © 2005 Elsevier B.V. All rights reserved.