摘要
保存隐私的计算几何学是特殊安全多党的计算；有许多应用。为决定一个点是否在一个圆内的以前的协议不是足够安全的。我们在场为计算在二个私人点之间的距离的一个二回合的协议；基于距离协议为点圆包括问题开发一个更多的有效协议。与前一解比较，我们的协议不仅是更安全的而且减少通讯回合的数字；模乘法的数字显著地。
Privacy-preserving computational geometry is a special secure multi-party computation and has many applications. Previous protocols for determining whether a point is inside a circle are not secure enough. We present a two-round protocol for computing the distance between two private points and develop a more efficient protocol for the point-circle inclusion problem based on the distance protocol. In comparison with previous solutions, our protocol not only is more secure but also reduces the number of communication rounds and the number of modular multiplications significantly.
基金
Supported by the National Natural Science Foundation of China （Grant No. 60573171）, the National Grand Fundaznental Research 973 Program of China, （Grant No. 2006CB303006）,and Research Program of Anhui Province Education Department （Grant Nos.2006KJ024A and JYXM2005166）. We are very grateful to Professor X. Yao at University of Birmingham for useful comments and some corrections. We also thank Professor H. Shen at Japhan Advanced Institute of Science and Technology for helpful suggestions.
关键词
计算机
安全协议
乘法
运算器
secure multi-party computation, computational geometry, homomorphic encryption scheme, private comparison
