Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
Secure Computation of the Vector Dominance Problem
verfasst von : Jin Yuan, Qingsong Ye, Huaxiong Wang, Josef Pieprzyk
Erschienen in: Information Security Practice and Experience
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.