一个点与矩形区域包含关系的安全判定协议

A Security Protocol for Points-Rectangle Area Inclusion

点与矩形区域包含关系的安全判定是指两个用户基于各自的输入信息,共同完成矩形区域是否包含点的判定,并且双方都不能获得对方的输入信息,该问题是一个安全两方计算问题,广泛应用于竞标、拍卖等不泄露信息的商业领域。通过对点与矩形区域位置关系的分析,得到一个判定点与矩形区域位置的公式,然后基于点积协议设计了一个点与矩形区域包含关系的安全判定协议,并且分析了协议的正确性、安全性和复杂性。在保护用户私有输入信息的条件下,解决了点与矩形区域的位置关系判定问题。

The relationship of a point and a rectangle area is that two parties based on the input of information to 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 commerce field. In this paper, a protocol for the points- rectangle area inclusion problem which is based on scalar product protocol is developed, and its correcmess, security and complexity are analyzed, and the corresponding algorithms for determining the relative position of point and rectangle area are also presented.