Partial Fairness in Secure Two-Party Computation

  • S. Dov Gordon
  • Jonathan Katz
Conference paper

DOI: 10.1007/978-3-642-13190-5_8

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6110)
Cite this paper as:
Gordon S.D., Katz J. (2010) Partial Fairness in Secure Two-Party Computation. In: Gilbert H. (eds) Advances in Cryptology – EUROCRYPT 2010. EUROCRYPT 2010. Lecture Notes in Computer Science, vol 6110. Springer, Berlin, Heidelberg

Abstract

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 ×YZ1 ×Z2 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).

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • S. Dov Gordon
    • 1
  • Jonathan Katz
    • 1
  1. 1.Department of Computer ScienceUniversity of Maryland 

Personalised recommendations