Secure computation of the vector dominance problem

Jin Yuan; Qingsong Ye; Huaxiong Wang; Josef Pieprzyk

doi:10.1007/978-3-540-79104-1_23

Secure computation of the vector dominance problem

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

^*Corresponding author for this work

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

5 Citations (Scopus)

Abstract

Suppose two parties, holding vectors A∈=∈(a ₁,a ₂,...,a _n ) and B∈=∈(b ₁,b ₂,...,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 language	English
Title of host publication	Information Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings
Editors	Liqun Chen, Yi Mu, Willy Susilo
Place of Publication	Berlin
Publisher	Springer, Springer Nature
Pages	319-333
Number of pages	15
ISBN (Electronic)	9783540791041
ISBN (Print)	3540791035, 9783540791034
DOIs	https://doi.org/10.1007/978-3-540-79104-1_23
Publication status	Published - 2008
Event	4th Information Security Practice and Experience Conference, ISPEC 2008 - Sydney, NSW, Australia Duration: 21 Apr 2008 → 23 Apr 2008

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4991 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	4th Information Security Practice and Experience Conference, ISPEC 2008
Country/Territory	Australia
City	Sydney, NSW
Period	21/04/08 → 23/04/08

Access to Document

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

Cite this

Yuan, J., Ye, Q., Wang, H., & Pieprzyk, J. (2008). Secure computation of the vector dominance problem. In L. Chen, Y. Mu, & W. Susilo (Eds.), Information Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings (pp. 319-333). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4991 LNCS). Springer, Springer Nature. https://doi.org/10.1007/978-3-540-79104-1_23

Yuan, Jin ; Ye, Qingsong ; Wang, Huaxiong et al. / Secure computation of the vector dominance problem. Information Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings. editor / Liqun Chen ; Yi Mu ; Willy Susilo. Berlin : Springer, Springer Nature, 2008. pp. 319-333 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{ad56f4266f71464eab8c2971f54ac039,

title = "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.",

author = "Jin Yuan and Qingsong Ye and Huaxiong Wang and Josef Pieprzyk",

year = "2008",

doi = "10.1007/978-3-540-79104-1_23",

language = "English",

isbn = "3540791035",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer, Springer Nature",

pages = "319--333",

editor = "Liqun Chen and Yi Mu and Willy Susilo",

booktitle = "Information Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings",

address = "United States",

note = "4th Information Security Practice and Experience Conference, ISPEC 2008 ; Conference date: 21-04-2008 Through 23-04-2008",

}

Yuan, J, Ye, Q, Wang, H & Pieprzyk, J 2008, Secure computation of the vector dominance problem. in L Chen, Y Mu & W Susilo (eds), Information Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4991 LNCS, Springer, Springer Nature, Berlin, pp. 319-333, 4th Information Security Practice and Experience Conference, ISPEC 2008, Sydney, NSW, Australia, 21/04/08. https://doi.org/10.1007/978-3-540-79104-1_23

Secure computation of the vector dominance problem. / Yuan, Jin; Ye, Qingsong; Wang, Huaxiong et al.
Information Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings. ed. / Liqun Chen; Yi Mu; Willy Susilo. Berlin: Springer, Springer Nature, 2008. p. 319-333 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4991 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

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 -

Yuan J, Ye Q, Wang H, Pieprzyk J. Secure computation of the vector dominance problem. In Chen L, Mu Y, Susilo W, editors, Information Security Practice and Experience - 4th International Conference, ISPEC 2008, Proceedings. Berlin: Springer, Springer Nature. 2008. p. 319-333. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-540-79104-1_23

Secure computation of the vector dominance problem

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this