集合交集与并集的安全多方计算  

Secure Multiparty Computation of Set Intersection and Union

作　　者：谢琼 王维琼[1] 许豪杰 XIE Qiong;WANG Weiqiong;XU Haojie(School of Science,Chang’an University,Xi’an 710064,China)

机构地区：[1]长安大学理学院,西安710064

出　　处：《计算机科学》2024年第2期371-377,共7页Computer Science

基　　金：陕西省自然科学基础研究计划(2020JQ-343);陕西省高校科协青年人才托举计划(20200505)。

摘　　要：集合的安全多方计算问题是保密科学计算研究的重要问题之一,在电子选举、门限签名、保密拍卖等场景中有着重要的应用。文中主要研究多个集合的保密计算问题,首先针对不同的集合运算提出了对应的转化方式将集合转化为向量,然后基于哥德尔编码提出了新的编码方式,再结合ElGamal门限加密算法设计了半诚实模型下可输出多个集合交集或并集,以及同时输出交集与并集的保密计算协议,最后应用模拟范例证明了协议的安全性,协议可以抵抗任意的合谋攻击。实验测试了协议的执行效率,当集合的势满足一定条件时,与现有协议相比,所提协议的计算效率更高。Secure multiparty computation of sets is one of the most important problems in confidential scientific computing research,which has significant applications in electronic election,threshold signature,and confidential auction.This paper mainly studies secure set operations for multiple parties.Corresponding coding methods are proposed for different set operations to transform sets into vectors,and then these vectors are divided in pairs and encoded by G del coding.Combined with the ElGamal threshold encryption algorithm with homomorphism,several secure computing protocols for set intersection and union operations are designed in the semi-honest model.These protocols can resist any collusive attack of arbitrary parties and the simulation paradigm is used to prove that these proposed protocols are secure in the semi-honest model.The protocols’efficiency is verified by experiments.When the cardinality of set meets certain conditions,the proposed protocols have higher computational efficiency compared with the existing schemes.

关 键 词：安全多方计算 集合交集与并集 ElGamal加密算法 半诚实模型 模拟范例 

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