Research on Secure Multi-party Computational Geometry

With rapid growth of the internet, a plenty of collaboration opportunities exist when organizations and individuals share information or cooperate to compute in a distributed system. The cooperation may occur between mutually untrusted parties or competitors. This problem is referred to Secure Multi-party Computation (SMC) problem. Secure multi-party computational geometry (SMCG) is a new field of SMC. Due to the widely potential applications, the research of SMCG becomes more and more attractive. In this paper, research frameworks of SMCG are demonstrated. From an applied viewpoint, some basic and key techniques for building secure protocols to solve SMCG problems are described. At the same time, future research orientations of the SMCG are proposed in the end.

[1]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[2]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[3]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[4]  Shafi Goldwasser,et al.  Multi party computations: past and present , 1997, PODC '97.

[5]  Christian Cachin,et al.  Efficient private bidding and auctions with an oblivious third party , 1999, CCS '99.

[6]  Moni Naor,et al.  Oblivious transfer and polynomial evaluation , 1999, STOC '99.

[7]  Wenliang Du,et al.  Secure multi-party computation problems and their applications: a review and open problems , 2001, NSPW '01.

[8]  Wenliang Du,et al.  Secure Multi-party Computational Geometry , 2001, WADS.

[9]  Shundong Li,et al.  Secure Two-Party Computational Geometry , 2005, Journal of Computer Science and Technology.

[10]  Dai Yiqi,et al.  Secure Multi-Party Computation of Set-Inclusion and Graph-Inclusion , 2005 .

[11]  Li Shundong,et al.  A secure multi-party computation solution to intersection problems of sets and rectangles , 2006 .

[12]  Huang Liusheng,et al.  Privacy Protection in the Relative Position Determination for Two Spatial Geometric Objects , 2006 .

[13]  Yonglong Luo,et al.  Secure Two-Party Point-Circle Inclusion Problem , 2007, Journal of Computer Science and Technology.

[14]  Chen Ping.  Privacy-Preserving Point-Line Relation Determination Protocol and Its Applications , 2008 .

[15]  Xiao Qian.  A Study of Secure Two-Party Circle Computation Problem , 2009 .

[16]  Liu Wen.  A Privacy-Preserving Triangle Inequality Determination Protocol and Its Applications , 2009 .

[17]  Ling Tong,et al.  Privacy-Preserving Segment-Ellipse Intersect-Determination Protocol , 2010, 2010 2nd International Conference on E-business and Information System Security.

[18]  Shoushan Luo,et al.  Secure Multi-Party Comparing Protocol Based on Multi-Threshold Secret Sharing Scheme , 2010, 2010 6th International Conference on Wireless Communications Networking and Mobile Computing (WiCOM).

[19]  Ji Zhang,et al.  Privacy-Preserving Protocols for String Matching , 2010, 2010 Fourth International Conference on Network and System Security.