###
工程科学与技术:2019,51(3):151-157
本文二维码信息
码上扫一扫!
基于多项式表示的集合问题安全计算协议
(1.湖北工业大学 计算机学院, 湖北 武汉 430068;2.西红柿科技(武汉)有限公司, 湖北 武汉 430076)
Secure Computation Protocols for Set Operations Based on Polynomial Representation of Sets
(1.School of Computer Sci., Hubei Univ. of Technol., Wuhan 430068, China;2.Tomato Technol. Co., Ltd., Wuhan 430076, China)
摘要
图/表
参考文献
相似文献
本文已被:浏览 2007次   下载 751
投稿时间:2018-09-25    修订日期:2019-03-14
中文摘要: 针对集合问题安全计算方案在实际应用中的低效率及存在安全漏洞等问题,利用多项式表示技术将集合问题转化为多项式求值问题,结合离散对数问题提出了集合成员关系以及集合交集问题的安全两方计算协议。首先,从最近一个高效的集合成员关系计算协议的安全缺陷出发,分析存在的安全漏洞是在一定条件下可以通过穷举攻击获得参与方输入的元素信息,导致参与方的隐私信息得不到保障。为克服该安全漏洞,将集合表示为多项式,并对多项式进行随机化,以确保参与方交互过程中不会发生任何泄漏;然后,结合离散对数问题,提出了安全的集合成员关系计算协议。该协议能够快速判断输入的元素是否属于一个集合,并且除了集合的势,没有泄露参与双方的任何其他信息。接着,将完善后的集合成员关系计算协议进一步扩展,提出了能够解决集合交集问题的安全两方计算协议。利用该协议,互不信任的参与方能有效计算集合的交集,而不泄露自身的隐私信息。最后,在半诚实模型下,结合概率多项式时间模拟器,给出了两个协议的安全性证明,证明了模拟器视图与原协议执行视图在计算上无法区分;详细分析了本文协议的性能,结果表明提出的集合成员关系计算协议及集合交集安全计算协议比其他相关协议效率更高,具有较小的通信复杂度及计算复杂度。
Abstract:In order to improve efficiency and solve the security vulnerabilities of the secure set computation protocols in practical applications, two secure two-party protocols for set membership and set intersection were proposed based on discrete logarithm problem and the polynomial representation of sets with which the set operation problem could be transformed into a polynomial evaluation problem. Firstly, a latest efficient secure set membership protocol was analyzed, and a security vulnerability of leaking the privacy of the participants by obtaining the element of participants on the brute attack was found. To overcome the security vulnerability, a new method was introduced by representing sets by polynomials and randomizing the polynomials, which could ensure the security of the participants without any leakage of interactions. Based on the discrete logarithm problem and the new method, a new secure set membership protocol was presented. The protocol could judge set-element membership with high-efficiency, and did not leak any other information about the participants besides the size of the set. Further, a secure set intersection protocol was showed according to the same technique. The security proofs of both protocols were given under the semi-honest model by using the probability polynomial time simulator, which indicated that the simulator views were computationally indistinguishable from the original protocols' execution views. Finally, the detailed analysis about the protocols' performance was presented, showing that both protocols were more efficient than other protocols since their communication complexity and computational complexity were smaller.
文章编号:201801058     中图分类号:TP309    文献标志码:
基金项目:国家自然科学基金项目(61701173);湖北省自然科学基金项目(2017CFB596);湖北工业大学绿色工业科技引领计划项目(ZZTS2017006)
作者简介:阮鸥(1976-),男,教授,博士.研究方向:抗泄漏密码学;安全多方计算.E-mail:ruanou@163.com
引用文本:
阮鸥,王子豪,卢永雄.基于多项式表示的集合问题安全计算协议[J].工程科学与技术,2019,51(3):151-157.
RUAN Ou,WANG Zihao,LU Yongxiong.Secure Computation Protocols for Set Operations Based on Polynomial Representation of Sets[J].Advanced Engineering Sciences,2019,51(3):151-157.