Title :
Two protocols for computing the sub-polygon´s areas divided by a line
Author :
Zhong Hong ; Hong, Zhong ; Shi Runhua
Author_Institution :
Key Lab. of Intell. Comput. & Signal Process., Anhui Univ., Hefei, China
Abstract :
Secure Multi-party Computation (SMC) plays an important role in information security under the circumstance of cooperation calculation, so SMC on privacy-preservation is of great interest. In this paper we discuss an issue which is a special SMC problem. Based on Scalar Product Protocol, Monte Carlo Method and Oblivious Transfer, we give two solutions to the problem about how to decide the areas. That is, a polygon is divided into two parts by a line: S1 and S2. Furthermore, we analyze the security and computational complexity, as well as the comparison of these two protocols. The results of analysis show that the proposed protocols are secure and efficient. We believe the two protocols will be useful in other geometric and combinatorial problems.
Keywords :
Monte Carlo methods; combinatorial mathematics; computational complexity; computational geometry; data privacy; security of data; Monte Carlo method; combinatorial problem; computational complexity; cooperation calculation; geometric problem; information security; oblivious transfer; privacy-preservation; scalar product protocol; secure multiparty computation; sub-polygon areas; Computers; Geometry; Area; Computational Geometry; Privacy-Preserving; Scalar Product Protocol; Secure Multi-party Computation;
Conference_Titel :
Advanced Computer Theory and Engineering (ICACTE), 2010 3rd International Conference on
Conference_Location :
Chengdu
Print_ISBN :
978-1-4244-6539-2
DOI :
10.1109/ICACTE.2010.5579057
