Secure computation of the vector dominance problem

Abstract

Suppose two parties, holding vectors A∈=∈(a 1,a 2,...,a n ) and B∈=∈(b 1,b 2,...,b n ) respectively, wish to know whether a i ∈>∈b i for all i, without disclosing any private input. This problem is called the vector dominance problem, and is closely related to the well-studied problem for securely comparing two numbers (Yao's millionaires problem). In this paper, we propose several protocols for this problem, which improve upon existing protocols on round complexity or communication/computation complexity. © 2008 Springer-Verlag Berlin Heidelberg.