Secure Two-Party Multi-Dimensional Vector Comparison Protocol
Lei Shi, Yonglong Luo, Caiyun Zhang · 2009
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.