Efficient protocols for point-convex hull inclusion decision problems
|
| Title | Efficient protocols for point-convex hull inclusion decision problems |
| Authors | |
| Abstract | Secure Multi-party Computation (SMC) is dedicated to solve trust problems in cooperative computing with each participant’s private data. Privacy Preserving Computational Geometry (PPCG) is a special area in SMC and being widely researched. In the real world, PPCG theories can be found being used in various occasions such as military cooperation, commercial competitions and so on. Point-convex hull inclusion problem is a practical case in PPCG and has its profound values. This paper firstly investigates the point inclusion problem with static convex hull, and then marches on to the cases of active convex hull, including the parallel moving and rotating ones. To solve the problems above, we propose a secure protocol to determine the relative position of a private point and a private convex hull in the first place. Compared with previous solutions, our protocols perform better in efficiency, especially when the number of the convex hull’s point is large. |
| Publisher | ACADEMY PUBLISHER |
| Date | 2010-05-01 |
| Source | Journal of Networks Vol 5, No 5 (2010) |
| Rights | Copyright © ACADEMY PUBLISHER - All Rights Reserved.To request permission, please check out URL: http://www.academypublisher.com/copyrightpermission.html. |