Privacy-preserving computational geometry
 | This article or section is in a state of significant expansion or restructuring. You are welcome to assist in its construction by editing it as well. If this article or section has not been edited in several days, please remove this template. If you are the editor who added this template and you are actively editing, please be sure to replace this template with {{in use}} during the active editing session. Click on the link for template parameters to use.
This article was last edited by Altenmann (talk | contribs) 11 years ago. (Update timer) |
Privacy-preserving computational geometry is the research area on the intersection of the domains of secure multi-party computation (SMC) and computational geometry. Classical problems of computational geometry reconsidered from the point of view of SMC include shape intersection, private point inclusion problem, range searching, convex hull,[1] and more.[2]
A pioneering work in this area was a 2001 paper by Atallah and Du, [3] in which the secure point in polygon inclusion and polygonal intersection problems were considered.
Other problems are computation of the distance between two private points[4] and secure two-party point-circle inclusion problem.[5]
References
- ^ [1]
- ^ Kaitai LIANG, Bo YANG, Dake HE, Min ZHOU, Privacy-Preserving Computational Geometry Problems on Conic Sections, Journal of Computational Information Systems 7: 6 (2011) 1910-1923
- ^ Atallah M J, Du W. Secure Multiparty Computational Geometry. In Proc. Algorithms and Data Structures: 7th International Workshop, WADS 2001, Lecture Notes in Computer Science, LNCS 2125, Providence, RI, USA, pages 165-179, August, 8-10, 2001. (As cited by Liang et al. 2011)
- ^ Li S D, Dai Y Q. Secure two-party computational geometry. Journal of Computer Science and Technology, 20(2): pages 258-263, 2005.
- ^ Luo Y L, Huang L S, Zhong H. Secure two-party point-circle inclusion problem. Journal of Computer Science and Technology, 22(1): pages 88-91, 2007