A security solution to the Points-Hyperspace Inclusion problem

Privacy-preserving computational geometry (PPCG) is a Secure Multi-party Computation problem. Determining the relationship of a point and a hyperspace is a security of the points-range inclusion problem which is one of PPCG problems. This paper studies the special SMC protocols to solve the special computational geometry problem, uses random technology to improve efficiency, so that it can be better used in online transactions and other applications. Firstly, a protocol for the Points-Rectangle Area Inclusion problem which is based on multiplication protocol is developed. Then a probability algorithm for Points-Hyperspace Inclusion problem is presented. The probability algorithm is proved that it is a true-biased Monte Carlo algorithm. Both of the theoretical analysis and the experiment results show that the probability algorithm is efficient.

[1]  Luo,et al.  A Secure Protocol for Determining Whether a Point is Inside a Convex Polygon , 2006 .

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

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

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

[5]  Josh Benaloh,et al.  Dense Probabilistic Encryption , 1999 .

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

[7]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[8]  Taher ElGamal,et al.  A public key cyryptosystem and signature scheme based on discrete logarithms , 1985 .

[9]  T. Elgamal.  A public key cryptosystem and a signature scheme based on discrete logarithms , 1984, CRYPTO 1984.

[10]  Zhong Hong,et al.  A Multi-Candidate Electronic Voting Scheme Based on Secure Sum Protocol , 2006 .

[11]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

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

[13]  Chen Guo-liang.  An Algorithm for Privacy-preserving Boolean Association Rule Mining , 2005 .

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

[15]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.

[16]  Luo,et al.  Privacy-Preserving Distance Measurement and Its Applications , 2006 .

[17]  Jing Wei-wei.  A Protocol for Privacy-Preserving Intersect-Determination of Two Polygons , 2007 .