@article {15172,
	title = {Complete fairness in multi-party computation without an honest majority},
	journal = {Theory of Cryptography},
	year = {2009},
	month = {2009///},
	pages = {19 - 35},
	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 {\textquotedblleft}harder{\textquotedblright} in the multi-party setting, at least with regard to round complexity.},
	doi = {10.1007/978-3-642-00457-5_2},
	author = {Gordon,S. and Katz, Jonathan}
}
