TY - CHAP

T1 - Secure computation of the vector dominance problem

AU - Yuan, Jin

AU - Ye, Qingsong

AU - Wang, Huaxiong

AU - Pieprzyk, Josef

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=41549152568&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-79104-1_23

DO - 10.1007/978-3-540-79104-1_23

M3 - Chapter

AN - SCOPUS:41549152568

SN - 3540791035

SN - 9783540791034

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 319

EP - 333

BT - Information Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings

A2 - Chen, Liqun

A2 - Mu, Yi

A2 - Susilo, Willy

PB - Springer, Springer Nature

CY - Berlin

T2 - 4th Information Security Practice and Experience Conference, ISPEC 2008

Y2 - 21 April 2008 through 23 April 2008

ER -