计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (17): 107-109.DOI: 10.3778/j.issn.1002-8331.2010.17.030

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

关于安全判定点和区间包含关系的解决方法

张彩云,罗永龙,石 磊   

  1. 安徽师范大学 计算机科学技术系,安徽 芜湖 241003
  • 收稿日期:2008-12-03 修回日期:2009-02-23 出版日期:2010-06-11 发布日期:2010-06-11
  • 通讯作者: 张彩云

Security solution to points-range inclusion problem

ZHANG Cai-yun,LUO Yong-long,SHI Lei   

  1. Department of Computer Science,Anhui Normal University,Wuhu,Anhui 241003,China
  • Received:2008-12-03 Revised:2009-02-23 Online:2010-06-11 Published:2010-06-11
  • Contact: ZHANG Cai-yun

摘要: 点和区间包含关系的安全判定是指两个用户基于各自的输入信息,共同完成区间是否包含点的判定,并且双方都不能获得对方的输入信息,该问题是一个安全两方计算问题,其在军事、商业领域有着重要的应用前景。分别基于比较和同态加密方案设计了两个点和区间包含关系的安全判定协议,并且分析了协议的正确性、安全性和复杂性。

关键词: 安全多方计算, 计算几何, 同态加密方案

Abstract: The relationship of a point and a range is that two parties based on the input of information complete the security of the points-range inclusion problem,and they can’t get information from each other.It is a secure two-party computation problem,and can be applied in many fields,such as military field and commerce field.In this paper,two protocols for the points-range inclusion problem are developed.One is based on comparison,and the other is based on homomorphic encryption schemes.At the same time,their correctness,security and complexity are analysed.

Key words: secure multi-party computation, computational geometry, homomorphic encryption schemes

中图分类号: