计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (34): 80-81.DOI: 10.3778/j.issn.1002-8331.2010.34.025

• 网络、通信、安全 • 上一篇    下一篇

无信息泄漏的最近点对协议

黄宏升,仲 红,燕飞飞,孙彦飞   

  1. 安徽大学 计算智能与信号处理教育部重点实验室,合肥 230039
  • 收稿日期:2009-04-07 修回日期:2009-06-17 出版日期:2010-12-01 发布日期:2010-12-01
  • 通讯作者: 黄宏升

Two protocols for no-information leaked closest-pair of points

HUANG Hong-sheng,ZHONG Hong,YAN Fei-fei,SUN Yan-fei   

  1. Key Lab of Intelligent Computing & Signal Processing,Ministry of Education,Anhui University,Hefei 230039,China
  • Received:2009-04-07 Revised:2009-06-17 Online:2010-12-01 Published:2010-12-01
  • Contact: HUANG Hong-sheng

摘要: 安全多方计算(SMC)在解决网络环境下进行合作时的信息安全问题具有重要价值,因此,保护私有信息的安全多方计算是目前一个研究热点。分别利用数据扰乱技术和基于求解离散对数难题,在保护私有信息条件下,提出了两个求解几何计算中的最近点对问题的协议,并对这两个协议的安全性和计算复杂度进行了分析。

Abstract: Secure Multi-party Computation(SMC) plays an important role in information security under the circumstance of network cooperation,so SMC on privacy-preservation is of great interest.Based on data perturbation and discrete logarithm problem,two protocols are proposed which are used to solve the problem of closest-pair of points under the condition of privacy-preservation.Further more,the security and computational complexity are analyzed.

中图分类号: