Welcome to the resource topic for 2008/458
Title:
Complete Fairness in Multi-Party Computation Without an Honest Majority
Authors: S. Dov Gordon, 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.
ePrint: https://eprint.iacr.org/2008/458
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .