Secure computation of the vector dominance problem

Jin Yuan*, Qingsong Ye, Huaxiong Wang, Josef Pieprzyk

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

5 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationInformation Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings
EditorsLiqun Chen, Yi Mu, Willy Susilo
Place of PublicationBerlin
PublisherSpringer, Springer Nature
Number of pages15
ISBN (Electronic)9783540791041
ISBN (Print)3540791035, 9783540791034
Publication statusPublished - 2008
Event4th Information Security Practice and Experience Conference, ISPEC 2008 - Sydney, NSW, Australia
Duration: 21 Apr 200823 Apr 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4991 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349


Other4th Information Security Practice and Experience Conference, ISPEC 2008
CitySydney, NSW


Dive into the research topics of 'Secure computation of the vector dominance problem'. Together they form a unique fingerprint.

Cite this