Partial Fairness in Secure Two-Party Computation
- S. Dov GordonAffiliated withDepartment of Computer Science, University of Maryland
- , Jonathan KatzAffiliated withDepartment of Computer Science, University of Maryland
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).
- Partial Fairness in Secure Two-Party Computation
- Book Title
- Advances in Cryptology – EUROCRYPT 2010
- Book Subtitle
- 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, French Riviera, May 30 – June 3, 2010. Proceedings
- pp 157-176
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
To view the rest of this content please follow the download PDF link above.