Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (4): 87-89.DOI: 10.3778/j.issn.1002-8331.2011.04.024

• 网络、通信、安全 • Previous Articles     Next Articles

Protocol for privacy-preserving space closest-pair of points

ZHONG Hong1,2,SUN Yanfei2,YAN Feifei2,HUANG Hongsheng2   

  1. 1.Key Laboratory of Intelligent Computing & Signal Processing,Ministry of Education,Anhui University,Hefei 230039,China
    2.School of Computer Science and Technology,Anhui University,Hefei 230039,China
  • Received:2009-05-22 Revised:2009-08-10 Online:2011-02-01 Published:2011-02-01
  • Contact: ZHONG Hong


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

  1. 1.安徽大学 计算智能与信号处理教育部重点实验室,合肥 230039
    2.安徽大学 计算机科学与技术学院,合肥 230039
  • 通讯作者: 仲 红

Abstract: Secure multi-party computation is a research hotspot in the field of information security.Privacy-preserving space closest-pair of points is a special secure multi-party computation problem.It can be applied to many fields,such as commerce and military field.Based on semi-honest model and authenticated channel,this paper presents find Minimum Protocol,then constructs a protocol which can solve the privacy-preserving closest-pair of points with homomorphic encryption schemes,finally illustrates the correctness of the protocol and makes a precise analysis of complexity and security.The analysis shows that the new protocol is more efficient than current protocol.

Key words: secure multi-party computation, privacy-preserving, homomorphic encryption, closest-pair of points

摘要: 安全多方计算是当前信息安全领域的一个研究热点,保护私有信息的最近点对是一个特殊的安全多方计算问题,在商业、军事等领域都有重要的应用前景。基于半诚实模型和认证信道,设计了向量差最小值协议,利用同态加密方案构建了一个求解保护私有信息的最近点对协议,并对此协议的正确性进行了理论证明,对其安全性和复杂度进行了理论分析,结果表明该协议性能优于现有协议。

关键词: 安全多方计算, 私有信息, 同态加密, 最近点对

CLC Number: