论文部分内容阅读
多方保密计算是近年来国际密码学领域的一个研究热点,它使拥有隐私数据的参与者能够共同合作利用这些隐私数据保密地参加运算,同时又不泄露自己的隐私数据,因而使人们能够最大限度地利用隐私数据而不破坏数据的保密性.计算几何问题的多方保密计算是其中的一个重要组成部分.研究几何图形相交问题的解决方案在计算几何的多方保密计算中有重要的意义.本文协议2是用朴素的方法解决了两条直线相交问题的多方保密计算,协议3是用Paillier的同态加密算法研究两条直线相交问题的多方保密计算.首先针对已有的两直线相交问题解决方案效率低的缺点,提出了两个新的解决方案,降低了计算复杂性和通信复杂性.接着在协议3的基础上研究了直线与平面相交问题,提出了该问题的解决方案.还利用模拟范例证明了该文提出的2个问题的多方保密计算方案是安全的.最后,给出了以上协议的计算复杂性和通信复杂性分析.
Multi-party cryptographic computing is a research hotspot in the field of international cryptography in recent years that enables participants who have private data to work together in secret to participate in computing using these private data without revealing their private data, thus enabling people to maximize The use of private data without compromising the confidentiality of the data.The calculation of geometric problems of multi-party security calculations is an important part of the study of geometric intersection solution to the problem of multi-dimensional computational geometry is of great significance in the security calculation.This protocol 2 is a simple method to solve the problem of multi-line secret intersection of two straight lines. Protocol 3 is to use Paillier’s homomorphic encryption algorithm to study the multi-party secure calculation of two straight line intersection problems. Firstly, Low efficiency and low efficiency, two new solutions are proposed to reduce the computational complexity and communication complexity.And then, based on protocol 3, we study the problem of intersection of straight line and plane, and propose the solution of this problem.We also use the simulation The example shows that the proposed two-item multi-party secure computing scheme is secure Finally, the computational complexity and communication complexity of the above protocols are given.