云环境下集合隐私计算

多方保密计算是网络空间安全与隐私保护的关键技术,基于同态加密算法的多方保密计算协议是解决云计算安全的一个重要工具.集合隐私计算是多方保密计算的一个基本问题,具有广泛的应用.现有的集合隐私计算方案多是基于两方的情况,基于多方的方案较少,效率较低,且这些方案都不能扩展到云计算平台.本文首先设计了一种新的编码方案,根据新的编码方案和同态加密算法在云计算环境下构造了一个具有普遍适用性且抗合谋的保密计算集合并集问题解决方案.该方案中的同态加密算法既可以是加法同态又可以是乘法同态的加密算法.本文进一步利用哥德尔编码和ElGamal公钥加密算法构造了一种适用于云计算的高效集合并集计算方案.这些方案还可以对多个集合中的所有数据进行保密排序,并证明这些方案在半诚实模型下是安全的.本文中的方案经过简单改造,也可以保密地计算多个集合的交集.

Secure Set Computing in Cloud Environment

Secure multiparty computation (SMC) is a key technology of cyberspace security and privacy preserving, and it is vital to provide secure cloud computing with SMC based on homomorphic encryption schemes. Secure set computing, which has widely applications, is a fundamental problem in SMC. Existing solutions to secure set computing are more constructed between two parties, but less presented among multiparty. These schemes are inefficient, and are hardly adequated to cloud computing. This study proposes a new coding scheme and incorporates homomorphic encryption algorithm to construct a protocol for secure set union computing on cloud computing. The proposed scheme is universal and secure against the collusion of participants. The homomorphic encryption adopted may be either additive or multiplicative. We also propose an efficient secure set union computing scheme for cloud computing, incorporating the G?del numbering and ElGamal public key encryption. The proposed schemes can be used to sort for multiple sets, and these schemes are proved to be secure in the semi-honest model. In addition, with few modifications, our protocol can also privately compute the intersection of multiple sets.