Complete Fairness in Multi-party Computation without an Honest Majority

  • S. Dov Gordon
  • Jonathan Katz
Conference paper

DOI: 10.1007/978-3-642-00457-5_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5444)
Cite this paper as:
Gordon S.D., Katz J. (2009) Complete Fairness in Multi-party Computation without an Honest Majority. In: Reingold O. (eds) Theory of Cryptography. TCC 2009. Lecture Notes in Computer Science, vol 5444. Springer, Berlin, Heidelberg


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.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

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

Personalised recommendations