Cryptology ePrint Archive: Report 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.

Category / Keywords: multiparty computation, fairness

Date: received 30 Oct 2008, last revised 30 Oct 2008

Contact author: gordon at cs umd edu

Available format(s): PDF | BibTeX Citation

Version: 20081102:232836 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]