Chapter

Theory of Cryptography

Volume 5444 of the series Lecture Notes in Computer Science pp 19-35

Complete Fairness in Multi-party Computation without an Honest Majority

  • S. Dov GordonAffiliated withDept. of Computer Science, University of Maryland
  • , Jonathan KatzAffiliated withDept. of Computer Science, University of Maryland

Abstract

Gordon et al. recently showed that certain (non-trivial) functions can be computed with complete fairness in the two-party setting. Motivated by their results, we initiate a study of complete fairness in the multi-party case and demonstrate the first completely-fair protocols for non-trivial functions in this setting. We also provide evidence that achieving fairness is “harder” in the multi-party setting, at least with regard to round complexity.