Secure Two-party Protocols for Point Inclusion Problem

10.6633/IJNS.200907.9(1).01

Tony Thomas

Computational geometry ； multiparty computation ； point inclusion problem

International Journal of Network Security

9卷1期（2009 / 07 / 01）

1 - 7

英文

It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the resulting protocols depend on the size of the circuit that expresses the functionality to be computed and hence can be impractical. Hence special solutions are needed for specific problems for efficiency reasons. The point inclusion problem in computational geometry is a special multiparty computation and has got many applications. Previous protocols for the secure point inclusion problem are not adequate. In this paper we modify some known solutions to the point inclusion problem in computational geometry to the frame work of secure two-party computation.

1. 陳宣輯(2016)。視訊辨識技術應用於智慧型監控系統之研究。國立臺灣大學資訊工程學系學位論文。2016。1-163。 
2. 羅米拉(2016)。以奈米探針親和質譜法定量分析生物標記蛋白質變化與其醣基化修飾。國立臺灣大學化學系學位論文。2016。1-253。