Complete Fairness in Secure Two-Party Computation

@article{Gordon2011CompleteFI,
  title={Complete Fairness in Secure Two-Party Computation},
  author={S. D. Gordon and Carmit Hazay and Jonathan Katz and Yehuda Lindell},
  journal={J. ACM},
  year={2011},
  volume={58},
  pages={24:1-24:37}
}
In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. One desirable property is fairness which guarantees, informally, that if one party receives its output, then the other party does too. Cleve [1986] showed that complete fairness cannot be achieved in general without an honest majority. Since then, the accepted… Expand
119 Citations
Partial Fairness in Secure Two-Party Computation
  • 81
  • PDF
Secure Two-Party Computation with Fairness - A Necessary Design Principle
  • 4
  • PDF
On Fairness in Secure Computation
  • 12
  • Highly Influenced
Fairness in Secure Two-Party Computation with Rational Players
  • 1
  • Highly Influenced
  • PDF
1/p-Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
  • 46
  • PDF
On Complete Primitives for Fairness
  • 24
  • PDF
Secure Multiparty Computation with Partial Fairness
  • 1
  • PDF
Designing Fully Secure Protocols for Secure Two-Party Computation of Constant-Domain Functions
  • 4
  • Highly Influenced
  • PDF
Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions
  • 36
  • Highly Influenced
  • PDF
On the Power of an Honest Majority in Three-Party Computation Without Broadcast
  • PDF
...
1
2
3
4
5
...

References

SHOWING 1-4 OF 4 REFERENCES
Limits on the security of coin flips when half the processors are faulty
  • 399
  • Highly Influential
  • PDF
Fair computation and general functions in the presence of immoral majority
  • Advances in Cryptology — Crypto ’90, volume 537 of Lecture Notes in Computer Science. Springer
  • 1991
Foundations of Cryptography: Volume 1
  • 483
  • Highly Influential
Foundations of Cryptography Vol
  • 2: Basic Applications. Cambridge University Press, Cambridge, UK.
  • 2004