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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Gordon, S. D., & Katz, J. (2009). Complete fairness in multi-party computation without an honest majority. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5444 LNCS, pp. 19–35). https://doi.org/10.1007/978-3-642-00457-5_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
