Secure Two-Party Point-Circle Inclusion Problem |
| |
Authors: | Yong-Long Luo Liu-Sheng Huang Hong Zhong |
| |
Affiliation: | 1.Department of Computer Science, University of Science and Technology of China, Hefei 230027, China ;2.Department of Computer Science, Anhui Normal University, Wuhu 241000, China ;3.Anhui Province Key laboratory of Software in Computing and Communication, Hefei 230027, China |
| |
Abstract: | 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. |
| |
Keywords: | secure multi-party computation computational geometry homomorphic encryption scheme private comparison |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载免费的PDF全文 |