Anzeige
Erschienen in:
2010 | OriginalPaper | Buchkapitel
Partial Fairness in Secure Two-Party Computation
verfasst von : S. Dov Gordon, Jonathan Katz
Erschienen in: Advances in Cryptology – EUROCRYPT 2010
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
A seminal result of Cleve (STOC ’86) is that
complete
fairness is impossible to achieve in two-party computation. In light of this, various techniques for obtaining
partial
fairness have been suggested in the literature. We propose a definition of partial fairness within the standard real-/ideal-world paradigm that addresses deficiencies of prior definitions. We also show broad feasibility results with respect to our definition: partial fairness is possible for any (randomized) functionality
f
:
X
×
Y
→
Z
1
×
Z
2
at least one of whose domains or ranges is polynomial in size. Our protocols are always private, and when one of the domains has polynomial size our protocols also simultaneously achieve the usual notion of security with abort. In contrast to some prior work, we rely on standard assumptions only.
We also show that, as far as general feasibility is concerned, our results are
optimal
(with respect to our definition).