Secure Computation Scheme for the Intersection Area of Polygons Resistant to Malicious Participants

Abstract

In computer vision, the intersection determination of polygonal areas is utilized to segment different regions in an image and assist in detecting the boundaries of the regions. Moreover, the secure computation of the intersection area of polygons can solve the private calculation of geometric problems in machine learning. A security protocol under the semi-honest model was designed for the problem of secure computation of the intersection area of two polygons. This protocol adopts a new coding method and the Paillier homomorphic encryption algorithm. Aiming at the malicious behaviors that malicious participants may carry out in the semi-honest protocol, a secure computation protocol for the intersection area of polygons under the malicious model was designed by using methods such as hash function, cut-and-choose and zero-knowledge proof. The security of this protocol was proved, and its computational complexity and communication complexity were analyzed. Compared with the existing schemes, it is more efficient.