一个安全两方共享秘密的乘法协议  

Secure Two-party Protocol for Multiplication of Shared Secrets

作　　者：荆巍巍[1,2] 黄刘生[1,2] 罗永龙[1,2] 徐维江[1,2] 

机构地区：[1]中国科学技术大学计算机科学与技术系,安徽合肥230027 [2]国家高性能计算中心(合肥),安徽合肥230027

出　　处：《小型微型计算机系统》2009年第3期431-436,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(60703071);(60773032)资助;江苏省自然科学基金项目(BK2007060)资助;安徽省自然科学基金项目(070412043)资助

摘　　要：安全多方计算在军事、商业等领域具有重要的应用前景,已经引起众多信息安全研究者的重视.保护私有信息的共享秘密乘积计算问题是一个特殊的安全多方计算问题,而现有的安全乘法协议没有考虑多项式插值共享秘密的情况.本文设计一个安全两方多项式乘法协议,基于该协议提出一个安全两方共享秘密的乘法协议,并给出协议的正确性、安全性和复杂性的分析.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.

关 键 词：安全多方计算 预言机 合成定理 协议 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]