Title :
A Convex Hull Algorithm for Planar Point Set Based on Privacy Protecting
Author :
Wang Qiang ; Zhang Yuanping
Author_Institution :
Sch. of Comput. & Commun., Lanzhou Univ. of Sci. & Technol., Lanzhou
Abstract :
Research on secure multi-party computation is of great interest in the field of information security. To determine convex hull algorithm for planar point set or polygons may be applied in a large number of research fields, and at present, there are a lot of methods to solve this problem. In this paper, a protocol is schemed out to determine a line by two secret points. The method is applied to determine the whole convex hull of two secret planar point sets. The corresponding security and complexity are analysed.
Keywords :
computational geometry; data privacy; security of data; computational geometry; convex hull algorithm; information security; multiparty computation security; privacy protection; protocol; secret planar point sets; Computational geometry; Computer science; Computer science education; Cryptography; Educational technology; Electronic mail; Information security; Privacy; Protection; Protocols; Computational geometry; Convex hull; Protocol; Secure multi-party computation;
Conference_Titel :
Education Technology and Computer Science, 2009. ETCS '09. First International Workshop on
Conference_Location :
Wuhan, Hubei
Print_ISBN :
978-1-4244-3581-4
DOI :
10.1109/ETCS.2009.626
