Secure Two-party Protocols for Point Inclusion Problem

Details Secure Two-party Protocols for Point Inclusion Problem Secure Two-party Protocols for Point Inclusion Problem

2007-05-29

arxiv.org/abs/0705.4185v1

Computer Science

Cryptography and Security

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Secure Two-party Protocols for Point Inclusion Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Secure Two-party Protocols for Point Inclusion Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Secure Two-party Protocols for Point Inclusion Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-499101