Secure computation of the vector dominance problem
Data(s) |
2008
|
---|---|
Resumo |
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. |
Identificador | |
Publicador |
Springer Berlin Heidelberg |
Relação |
DOI:10.1007/978-3-540-79104-1_23 Yuan, Jin, Ye, Qingsong, Wang, Huaxiong, & Pieprzyk, Josef (2008) Secure computation of the vector dominance problem. Lecture Notes in Computer Science : Information Security Practice and Experience, 4991, pp. 319-333. |
Direitos |
Copyright 2008 Springer-Verlag Berlin Heidelberg |
Fonte |
School of Electrical Engineering & Computer Science; Science & Engineering Faculty |
Palavras-Chave | #Data Encryption #Computer Communication Networks #Systems and Data Security #Information Storage and Retrieval |
Tipo |
Journal Article |