A Secure Protocol for Point-Segment Position Problem

详细信息    查看全文

• 作者：Yi Sun ; Hongxiang Sun ; Hua Zhang ; Qiaoyan Wen
• 关键词：secure multi ; party computation ; point ; inclusion problem ; straddled segments ; privacy preserving computation geometry ; point ; segment position problem
• 刊名：Lecture Notes in Computer Science
• 出版年：2010
• 出版时间：2010
• 年：2010
• 卷：6318
• 期：1
• 页码：212-219
• 全文大小：191.9 KB

文摘

Privacy Preserving Computation Geometry is an important direction in the application of Secure Multi-party Computation and contains many research subjects, such as intersection problem, point-inclusion problem, convex hull, rang searching and so on. Particularly, point-inclusion problem is of great practical significance in our daily life. In this paper, we will devote our attention to the point-segment position problem in point-inclusion and aim to determine the relationship of a point and a segment. In our solution, we present a concise secure protocol based on two basic protocols, secure scalar product protocol and secure comparison protocol. Compared with precious solutions, which may disclose at least one inside point, our protocol performs better in terms of preserving privacy. It will not reveal any inside point, which is crucially significant in some special occasion.