Protocol to Compute Polygon Intersection in STC Model

Abstract

Intersection and union of convex polygons are basic issues in computational geometry, they can settle lots of matters such as economy and military affairs. To solve the problem that traditional method of making the polygons public could not satisfy the requirements of personal privacy, the protocol to compute intersection and union of convex polygons in secure two-party computation(STC) model was investigated. Along with the scan line algorithm and secret comparison protocol, the protocol completes the calculation without leaking so much information. The security and complexity analysis of the protocol are also given.