Efficient Secure Protocols to Determine Whether a Point is inside a Convex Hull

Authors:
Ye Yun;Huang Liusheng;Yang Wei;Zhou Zhengyou
Affiliations:
-;-;-;-
Venue:
IEEC '09 Proceedings of the 2009 International Symposium on Information Engineering and Electronic Commerce
Year:
2009

Citing 0
Cited 1

A secure protocol for point-segment position problem

WISM'10 Proceedings of the 2010 international conference on Web information systems and mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Secure Multi-party Computation (SMC) is dedicated to solve trust problems in cooperative computing with each participant’s private data. Privacy Preserving Computational Geometry (PPCG) is a special area in SMC and is being widely used. This paper investigates the problem of judging whether a point is in a convex hull or not. We firstly present a secure protocol to determine the position of a private point and a private line, based on which two efficient point-inclusion schemes are proposed. Compared with previous solutions, our protocols perform better in efficiency, especially when the number of the convex hull’s points is large.