高技术通讯2012，Vol.22Issue(12)：1225-1232,8.DOI:10.3772/j.issn.1002-0470.2012.12.002
基于保护隐私同余方程组协议的多秘密共享算法
A multi-secret sharing scheme based on a protocol for computation of simultaneous congruences for privacy-preserving
摘要
Abstract
Aiming at the problems of security, communication complexity and storage space in the Asmuth-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 theorem, the ElGamal 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 problems in the Asmuth-Bloom secret sharing scheme.关键词
安全多方计算/中国剩余定理/ElGamal同态加密/安全多方求和计算/同余方程组/多秘密共享Key words
secure multi-party computation/ Chinese remainder theorem/ ElGamal homomorphic encryption/secure multi-party sum computation/ simultaneous congruences/ multi-secret sharing引用本文复制引用
孙茂华,李涵,罗守山,辛阳..基于保护隐私同余方程组协议的多秘密共享算法[J].高技术通讯,2012,22(12):1225-1232,8.基金项目
863计划(2009AA01Z430)和国家发改委信息安全专项资助项目 （2009AA01Z430）
