Secure Two-party Protocol for Multiplication of Shared Secrets
Weijiang Xu
In this paper, the problem of secure two-party multiplication of shared secrets is considered, and it is one of problems of secure multi-party computation, where the policy for the shared secrets is based on polynomial interpolation. Firstly, a secure two-party protocol for polynomial multiplication is presented. Secondly, based on the first protocol, a protocol for secure two-party multiplication of shared secrets for semi-honest model is proposed, which is employed to multiply two shared secrets without revealing the private information of two parties. Furthermore, based on the definition of secure two-party computation and Composition Theorem, the proofs of security and analysis of the correctness and the complexity of our two protocols are given.
Journal of Chinese Computer Systems•Jan 1, 2009•0 citations