Computer Engineering and Applications ›› 2014, Vol. 50 ›› Issue (9): 37-40.

Previous Articles     Next Articles

Privacy preserving calculating intersection area of two polygons

FU Tianyu1,2, LUO Yonglong1,2, GUO Liangmin1,2, SUN Lingling1,2   

  1. 1.College of Mathematics and Computer Science, Anhui Normal University, Wuhu, Anhui 241003, China
    2.Engineering Technology Research Center of Network and Information Security, Anhui Normal University, Wuhu, Anhui 241003, China
  • Online:2014-05-01 Published:2014-05-14

保护私有信息的两多边形相交面积计算

傅天裕1,2,罗永龙1,2,郭良敏1,2,孙玲玲1,2   

  1. 1.安徽师范大学 数学计算机科学学院,安徽 芜湖 241003
    2.安徽师范大学 网络与信息安全工程技术研究中心,安徽 芜湖 241003

Abstract: Privacy-preserving computational geometry problem is a special branch of secure multi-party computation field. It is widely used in many fields such as military and commerce. A secure protocol for determining whether a point is inside a polygon is presented. And an approximate calculation method for area of intersection of two polygons is proposed. The correctness, security and complexity of these protocols are also discussed.

Key words: secure multi-party computation, computational geometry, point inclusion problem, area of intersection

摘要: 保护私有信息的计算几何是一类特殊的安全多方计算问题,在军事、商业等领域具有重要的应用前景。在半诚实模型下,利用点线叉积协议设计一个保护私有信息的点包含于多边形判定协议;基于该协议,提出保护私有信息的两多边形相交面积计算协议;分析和证明上述协议的正确性、安全性和复杂性。

关键词: 安全多方计算, 计算几何, 点包含, 相交面积