A Secure Two-Party Computation Protocol for Intersection Detection between Two Convex Hulls

by   Amirahmad Chapnevis, et al.

Intersection detection between three-dimensional bodies has various applications in computer graphics, video game development, robotics as well as military industries. In some respects, entities do not want to disclose sensitive information about themselves, including their location. In this paper, we present a secure two-party protocol to determine the existence of an intersection between entities. The protocol presented in this paper allows for intersection detection in three-dimensional spaces in geometry. Our approach is to use an intersecting plane between two spaces to determine their separation or intersection. For this purpose, we introduce a computational geometry protocol to determine the existence of an intersecting plane. In this paper, we first use the Minkowski difference to reduce the two-space problem into one-space. Then, the separating set is obtained and the separation of two shapes is determined based on the inclusion of the center point. We then secure the protocol by modifying the separating set computation method as a privacy-preserver and changing the Minkowski difference method to achieve this goal. The proposed protocol applies to any form of convex three-dimensional shape. The experiments successfully found a secure protocol for intersection detection between two convex hulls in geometrical shapes such as the pyramid and cuboid.


page 1

page 2

page 3

page 4


Secure and Scalable Circuit-based Protocol for Multi-Party Private Set Intersection

We propose a novel protocol for computing a circuit which implements the...

Blaschke and Separation Theorems for Orthogonally Convex Sets

In this paper, we deal with analytic and geometric properties of orthogo...

Private Set Intersection with Delegated Blind Quantum Computing

Private set intersection is an important problem with implications in ma...

a quantum secure multiparty computation protocol for least common multiple

In this paper, we present a secure multiparty computation (SMC) protocol...

Fast Actively Secure OT Extension for Short Secrets

Oblivious Transfer (OT) is one of the most fundamental cryptographic pri...

Secure Evaluation of Knowledge Graph Merging Gain

Finding out the differences and commonalities between the knowledge of t...

A Novel Approach for Ellipsoidal Outer-Approximation of the Intersection Region of Ellipses in the Plane

In this paper, a novel technique for tight outer-approximation of the in...

Please sign up or login with your details

Forgot password? Click here to reset