Partial Fairness in Secure Two-Party Computation

@article{Gordon2010PartialFI,
  title={Partial Fairness in Secure Two-Party Computation},
  author={S. D. Gordon and Jonathan Katz},
  journal={Journal of Cryptology},
  year={2010},
  volume={25},
  pages={14-40}
}
A protocol for secure computation is fair if either both parties learn the output or else neither party does. A seminal result of Cleve (STOC ’86) is that, in general, 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. We also show broad feasibility results with respect to our… Expand
81 Citations
Complete Fairness in Secure Two-Party Computation
  • 119
  • PDF
Secure Multiparty Computation with Partial Fairness
  • 1
  • PDF
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
  • 46
  • Highly Influenced
  • PDF
On Complete Primitives for Fairness
  • 24
  • PDF
Efficiently Making Secure Two-Party Computation Fair
  • 5
  • PDF
On Fairness in Secure Computation
  • 12
Computational Hardness of Optimal Fair Computation: Beyond Minicrypt
  • 1
  • PDF
Improvements to Secure Computation with Penalties
  • 46
  • PDF
Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
  • 5
  • Highly Influenced
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 41 REFERENCES
Complete Fairness in Secure Two-Party Computation
  • 119
  • PDF
On Fairness in Secure Computation
  • 12
On achieving the "best of both worlds" in secure multiparty computation
  • 69
  • PDF
Foundations of Secure Interactive Computing
  • 298
  • PDF
Optimistic Fair Secure Computation
  • 92
  • PDF
Resource Fairness and Composability of Cryptographic Protocols
  • 85
  • PDF
Completely fair SFE and coalition-safe cheap talk
  • 98
  • PDF
Fair Secure Two-Party Computation
  • 121
  • PDF
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
  • 141
  • PDF
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
  • 171
  • PDF
...
1
2
3
4
5
...