Complete Fairness in Multi-Party Computation Without an Honest Majority

S.  Dov Gordon; Jonathan Katz

Paper 2008/458

Complete Fairness in Multi-Party Computation Without an Honest Majority

S. Dov Gordon and Jonathan Katz

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.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: multiparty computation fairness
Contact author(s): gordon @ cs umd edu
History: 2008-11-02: received
Short URL: https://ia.cr/2008/458
License: CC BY

BibTeX

@misc{cryptoeprint:2008/458,
      author = {S.  Dov Gordon and Jonathan Katz},
      title = {Complete Fairness in Multi-Party Computation Without an Honest Majority},
      howpublished = {Cryptology ePrint Archive, Paper 2008/458},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/458}},
      url = {https://eprint.iacr.org/2008/458}
}