安全分布式乘积产生方案

Secure distributed generation of the product of shared secrets

提出了一种解决以下问题的新的方案:给定两个由全体群组成员共享的秘密,如何计算出其乘积但不泄漏除乘积以外任何其他秘密信息.该方案在无错情形时是一个两轮协议,其特点是运用了非交互的分布多乘法计算协议和W elch-Berlekamp解码算法,避免了使用零知识证明协议,从而更为有效.同时,通过构造了同模拟机协议给出了方案的安全性证明,达到了可证明安全.

A new protocol for the task that give two secrets O, 1 shared among 3 players, compute the product 0 1 but without any exposure about the secrets except the product is presented. It is a two-round protocol if new error occurs. The protocol uses the non-interactive distributed approach for multiplication of the shared secrets and the Welch-Berlekamp decoder for product reconstruction, which results in a more efficient protocol. To achieve provable security, the simulator protocol is given in the security proof.