Sciweavers

Share
TCC
2009
Springer

Complete Fairness in Multi-party Computation without an Honest Majority

9 years 10 months ago
Complete Fairness in Multi-party Computation without an Honest Majority
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. Dept. of Computer Science, University of Maryland. Email: {gordon,jkatz}@cs.umd.edu. This work was supported by NSF CAREER award #0447075 and US-Israel Binational Science Foundation grant #2004240.
S. Dov Gordon, Jonathan Katz
Added 25 Nov 2009
Updated 25 Nov 2009
Type Conference
Year 2009
Where TCC
Authors S. Dov Gordon, Jonathan Katz
Comments (0)
books