Paper 2008/458 Original: eprint.iacr.org/2008/458 ↗
Complete Fairness in Multi-Party Computation Without an Honest Majority
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
- Preprint.
- History
- 2008-11-02: last updated
- 2008-11-02: published
- Short URL
- https://ia.cr/2008/458
- License
- https://creativecommons.org/licenses/by/4.0/
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},
url = {https://eprint.iacr.org/2008/458}
}