摘要
隐私保护集合交集计算属于安全多方计算领域的特定应用问题,具有重要的研究价值和广泛的应用范围。在信息高速发展的时代,对该问题的研究满足了人们在日常生活中享受各种便利的同时隐私得到保护的需求。文章考虑的是两个参与者隐私保护集合交集计算的情形,首先将集合表示成多项式,把求解两个集合的交集问题转化为求解两个多项式的最大公因式问题;在此基础上,根据多项式的数学性质和Pailliar同态加密算法提出一种保护隐私的两方集合交集计算协议,并给出协议的正确性和安全性分析;最后通过与相关文献的比较分析,得出文章协议的计算复杂度和通信复杂度较低的结论,且能够很好地保护参与方集合的元素个数。
Privacy-preserving set intersection computation is a special application problem in the field of secure multi-party computation,which has important research value and a wide range of application.In the era of rapid development of information,the study on this problem meets the needs of people for privacy protection while people enjoy various conveniences in daily life.This paper considers the privacy-preserving set intersection of two participants.First,the problem of solving the intersection of two sets is transformed into the problem of solving the greatest common factor of two polynomials by expressing sets as polynomials.Then,according to the mathematical properties of polynomials and Pailliar homomorphic encryption algorithm,a protocol of privacy-preserving two-party set intersection computation is designed,and the correctness and the security analyses of the protocol are given.Finally,through the comparison and analysis with the related literature,it is concluded that the computational complexity and communication complexity of the proposed protocol are relatively low,and the number of elements in the participant set can be well protected.
作者
唐春明
林旭慧
TANG Chunming;LIN Xuhui(School of Mathematics and Information Science,Guangzhou University,Guangzhou 510006,China)
出处
《信息网络安全》
CSCD
北大核心
2020年第1期9-15,共7页
Netinfo Security
基金
国家自然科学基金面上项目[61772147]
广东省自然科学基金基础研究重大项目[2015A030308016]
广东省教育厅科研团队项目[2015KCXTD014]
广州市教育局协同创新重大项目[1201610005]
国家密码发展基金[MMJJ20170117]。
关键词
安全多方计算
隐私保护
集合交集
Pailliar同态加密算法
secure multi-party computation
privacy-preserving
set intersection
Pailliar homomorphic encryption algorithm