Secure Two-party Protocols for Point Inclusion Problem - Computer Science > Cryptography and SecurityReport as inadecuate




Secure Two-party Protocols for Point Inclusion Problem - Computer Science > Cryptography and Security - Download this document for free, or read online. Document in PDF available to download.

Abstract: It is well known that, in theory, the general secure multi-party computationproblem is solvable using circuit evaluation protocols. However, thecommunication complexity of the resulting protocols depend on the size of thecircuit that expresses the functionality to be computed and hence can beimpractical. Hence special solutions are needed for specific problems forefficiency reasons. The point inclusion problem in computational geometry is aspecial multiparty computation and has got many applications. Previousprotocols for the secure point inclusion problem are not adequate. In thispaper we modify some known solutions to the point inclusion problem incomputational geometry to the frame work of secure two-party computation.



Author: Tony Thomas

Source: https://arxiv.org/







Related documents