| Sun Maohua（孙茂华）*,Zhu Hongliang**,Li Qi**.[J].高技术通讯(英文),2015,21(4):471~478 |
|
| Secure planar convex hull protocol for large-scaled point sets in semi-honest model |
| |
| DOI：10.3772/j.issn.1006-6748.2015.04.014 |
| 中文关键词: |
| 英文关键词: secure multi-party computation, secure multi-party computational geometry (SMCG), secure planar convex hull protocol (SPCH), privacy-preserving point-inclusion protocol (PPPI), semi-honest model |
| 基金项目: |
| Author Name | Affiliation | | Sun Maohua（孙茂华）* | | | Zhu Hongliang** | | | Li Qi** | |
|
| Hits: 782 |
| Download times: 686 |
| 中文摘要: |
| |
| 英文摘要: |
| Efficiency and scalability are still the bottleneck for secure multi-party computation geometry (SMCG). In this work a secure planar convex hull (SPCH) protocol for large-scaled point sets in semi-honest model has been proposed efficiently to solve the above problems. Firstly, a novel privacy-preserving point-inclusion (PPPI) protocol is designed based on the classic homomorphic encryption and secure cross product protocol, and it is demonstrated that the complexity of PPPI protocol is independent of the vertex size of the input convex hull. And then on the basis of the novel PPPI protocol, an effective SPCH protocol is presented. Analysis shows that this SPCH protocol has a good performance for large-scaled point sets compared with previous solutions. Moreover, analysis finds that the complexity of our SPCH protocol relies on the size of the points on the outermost layer of the input point sets only. |
|
View Full Text
View/Add Comment Download reader |
| Close |
