A Study of Secure Two-Party Circle Computation Problem
Qian Xiao · Beijing Youdian Xueyuan xuebao · 2009
In computational geometry,circle-circle and line-circle relationship determination problems are important.If the information of circle or line is supplied by different users but no one would like to disclose his or her data to others,so it is called the secure two-party circle computation problem.A secure square of two real numbers sum protocol,a secure two real numbers relation determination protocol,a secure points distance computation protocol and a secure pointline distance computation protocol are proposed altogether by using secure twoparty scalar product protocol and additive homomorphic encryption.The correctness,the security and efficiency of the protocols are also analyzed.The circlecircle relation determination problem and line-circle relation determination problem are solved based on these protocols.