Secure Two-party Protocols for Point Inclusion Problem

TL;DR

This paper adapts existing solutions for the point inclusion problem in computational geometry to secure two-party computation, addressing efficiency issues in general multi-party protocols.

Contribution

It presents modified protocols for secure point inclusion tailored for two-party computation, improving practicality over previous methods.

Findings

Enhanced protocols for secure point inclusion

Reduced communication complexity in two-party setting

Applicable to real-world computational geometry tasks

Abstract

It is well known that, in theory, the general secure multi-party 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.