论文部分内容阅读
研究几何图形相交问题解决方案在计算几何的多方保密计算中有重要的意义。用不经意传输研究计算几何问题多方保密计算。首先针对已有的两线段相交问题解决方案计算复杂性高的缺点,提出了新的解决方案,降低了该问题的计算复杂性。接着研究2个新的多方保密计算问题:两任意多边形相交与2个任意几何图形相交问题的多方保密计算,提出了相应的解决方案。还利用模拟范例证明了该文提出的3个问题的多方保密计算解决方案是安全的。
It is of great significance to study how to solve geometric intersection problems in the multi-party computation of computational geometry. Multidisciplinary security calculations with inadvertent transmission of computational geometry. First of all, aiming at the shortcomings of high computational complexity of the existing two-segment intersection solution, a new solution is proposed to reduce the computational complexity of the problem. Then, we study two new multi-party secure computing problems: the multi-party secure computing with two arbitrary polygons intersected with two arbitrary geometric shapes, and put forward corresponding solutions. We also use simulation examples to prove that the proposed three-item multi-party secure computing solution is safe.