基于保护隐私同余方程组协议的多秘密共享算法①  

A multi-secret sharing scheme based of simultaneous congruences on a protocol for computation for privacy-preserving

作　　者：孙茂华[1,2] 李涵[1,2] 罗守山[1,2,3] 辛阳[1,2] 

机构地区：[1]北京邮电大学信息安全中心,北京100876 [2]灾备技术国家工程实验室,北京100876 [3]北京安码科技有限公司,北京100876

出　　处：《高技术通讯》2012年第12期1225-1232,共8页Chinese High Technology Letters

基　　金：863计划（2009AA012430）和国家发改委信息安全专项资助项目.

摘　　要：针对Asmuth—Bloom秘密共享方案存在的安全、复杂度和存储空间问题，研究了保护隐私的同余方程组的求解问题——安全多方科学计算领域中的新课题。在半诚实模型下利用中国剩余定理、安全多方求和协议和分布式E1Gamal同态加密协议，设计了保护隐私的同余方程组求解，分析了该协议的正确性、安全性和复杂性，并利用该协议设计了多秘密共享方案，该方案解决了Asmuth．Bloom秘密共享方案中存在的问题。Aiming at the problems of security, communication complexity and storage space in the Asnmth-Bloom secret sharing scheme, the problem of solving simultaneous congruences for privacy-preserving was studied. This problem is a new topic in the field of secure multi-party computation （SMC）. A protocol for computation of simultaneous congruences for privacy-preserving was designed under the semi-honest model based on the Chinese remainder theo- rem, the E1Gamal homomorphic encryption protocol and the secure multi-party sum computation. The correctness, security and complexity of the protocol were analyzed, and then a multi-secret sharing scheme was proposed based on the new protocol. It was proved that the new multi-secret sharing scheme can solve the above mentioned prob- lems in the Asmuth-Bloom secret sharin~ scheme.

关 键 词：安全多方计算 中国剩余定理 ElGamal同态加密 安全多方求和计算 同余方 程组 多秘密共享 

分 类 号：O156.1[理学—数学]