首页 | 本学科首页   官方微博 | 高级检索  
     

保护私有信息的集合交集协议
引用本文:孙彦飞,仲红,燕飞飞,黄宏升.保护私有信息的集合交集协议[J].计算机应用,2010,30(2):506-509.
作者姓名:孙彦飞  仲红  燕飞飞  黄宏升
作者单位:1. 安徽大学2.
基金项目:国家自然科学基金资助项目(60773114);;安徽省自然科学基金资助项目(070412051);;安徽高校省级重点自然科学研究项目(KJ2007A43)
摘    要:研究了安全多方计算中的保护私有信息的集合交集问题。在半诚实模型下,基于点积协议设计的两方集合交集协议,复杂度为O(ntp);设计的三方集合交集协议,复杂度为O(2ntp)。给出了协议的正确性理论证明,并对其安全性和复杂度进行了理论分析,性能优于现有协议。最后,给出了协议的推广应用以及不足。

关 键 词:安全多方计算  私有信息  集合交集  点积协议  
收稿时间:2009-08-25
修稿时间:2009-09-24

Protocol for privacy-preserving set intersection
SUN Yan-fei,ZHONG Hong,YAN Fei-fei,HUANG Hong-sheng.Protocol for privacy-preserving set intersection[J].journal of Computer Applications,2010,30(2):506-509.
Authors:SUN Yan-fei  ZHONG Hong  YAN Fei-fei  HUANG Hong-sheng
Affiliation:1.Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education/a>;Anhui University/a>;Hefei Anhui 230039/a>;China/a>;2.School of Computer Science and Technology/a>;China
Abstract:Privacy preserving set intersection was analyzed in the secure multi-party computation.Based on semi-honest model and scalar product protocol,a protocol of the bipartite set intersection was constructed,which complexity is O(ntp);another protocol of the tripartite set intersection needs O(2ntp).Then the correctness of these protocols was illustrated and the complexity and security were analyzed precisely.The analysis shows that the new protocols are more efficient than current protocols.Finally,the applicat...
Keywords:secure multi-party computation  privacy-preserving  set intersection  scalar product protocol  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用》浏览原始摘要信息
点击此处可从《计算机应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号