A Secure Protocol for Determining the Meeting Points of Two Intersected Circles

Secure multi-party computation (SMC) deals with the problem of secure computation among participants who are not trusted by others. Privacy preserving computational geometry is a special area in SMC and has been applied to various of areas such as military, commerce and governments et al. In this paper, we will propose an efficient secure protocol, which is based on numerical computation, for the problem of determining the meeting points of two intersected circles, which is a practical problem in our daily life. In our solution, the communicational complexity can be lowered to just O(12*(log R₁ + logr₂)), where R₁ and R₂ are the radius of the two circles respectively. We also present the experimental results in this paper.