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

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

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

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.