Secure Two-Party Multi-Dimensional Vector Comparison Protocol

Secure two-party vector dominance means that the two sides of the computation want to judge whether their vectors have the dominance relation securely, a new problem which is called Multi-Dimensional Vector Comparison Problem is proposed based on the vector dominance in this paper, it can be applied in many commercial areas, such as auction, bidding and so on. Two solutions are provided for this problem, using multiplication protocol and scalar products protocol respectively. Furthermore, we introduce the random algorithm to solve the problem, analyze the security, correctness and complexity, point out the differences between these two methods, and simulate by experiments.

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

[2]  Qin Jing.  A Protocol of Comparing Information without Leaking , 2004 .

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

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

[5]  Hong Shen,et al.  An Efficient Protocol for the Problem of Secure Two-party Vector Dominance , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

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

[7]  Andrew Chi-Chih Yao,et al.  How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.

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

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

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

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

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

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

[14]  Maged Hamada Ibrahim.  Two-Party Private Vector Dominance: The All-Or-Nothing Deal , 2006, Third International Conference on Information Technology: New Generations (ITNG'06).

[15]  A. Yao.  How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[16]  Yunghsiang Sam Han,et al.  Privacy-Preserving Multivariate Statistical Analysis: Linear Regression and Classification , 2004, SDM.

[17]  M. Rabin.  Probabilistic algorithm for testing primality , 1980 .