A new Lagrange solution to the privacy-preserving general geometric intersection problem

作者：Qin Jing^*; Duan Hongwei; Zhao Huawei; Hu Jiankun

来源：Journal of Network and Computer Applications, 2014, 46: 94-99.

DOI：10.1016/j.jnca.2014.08.004

• Intersection problem
• Judging private path problem
• Privacy-preserving computational geometry
• Lagrange multiplier method
• Security

Secure multi-party computation (SMC) is an important problem in cryptography. Existing solutions are mostly based on circuit evaluation protocols which are impractical. In this paper, a solution is proposed by abstracting the intersection problem and the judging private path problem into a general intersection problem, i.e., if two participants have a private curve and do not disclose their private curve data, how to solve two-free-plane-curve intersection problem in a cooperative environment. A systematic Lagrange multiplier method is proposed to combat the general intersection problem instead of focusing on normal curves case. The proposed systematic method can systematically deal with various intersection problems faced in practical applications. In addition, the proposed method can also solve the normal curves cases.

• 出版日期2014-11
• 单位山东大学; 山东财经大学