eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20081102:232836 of this paper.
See the latest version.
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 computationfairness
- Contact author(s)
- gordon @ cs umd edu
- History
- 2008-11-02: received
- Short URL
- https://ia.cr/2008/458
- License
-
CC BY
