论文标题
一个安全的两党计算协议，用于两个凸壳之间的相交检测
A Secure Two-Party Computation Protocol for Intersection Detection between Two Convex Hulls
论文作者
论文摘要
三维机构之间的交叉检测在计算机图形，视频游戏开发，机器人技术以及军事行业中都有各种应用。在某些方面，实体不想披露有关自己（包括其位置）的敏感信息。在本文中，我们提出了一个安全的两方协议，以确定实体之间的相交的存在。本文提出的协议允许在几何形状的三维空间中进行交叉检测。我们的方法是使用两个空间之间的相交平面来确定它们的分离或交点。为此，我们引入了计算几何协议，以确定相交平面的存在。在本文中，我们首先使用Minkowski差异将两个空间问题减少到一个空间中。然后，获得分离集，并根据中心点的包含确定两个形状的分离。然后，我们通过将分离设置的计算方法修改为隐私冠军并更改Minkowski差异方法来实现此目标来保护协议。该提出的协议适用于任何形式的凸三维形状。该实验成功地找到了在几何形状（例如金字塔和长方体）中的两个凸形船体之间的相交检测的安全方案。
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.
