@conference {634725,
	title = {Fairness with an honest minority and a rational majority},
	booktitle = {O. Reingold, editor, Proceedings of the Fourth Theory of Cryptography Conference (TCC {\textquoteleft}09), Lecture Notes in Computer Science},
	volume = {5444},
	year = {2009},
	pages = {36-53},
	publisher = {Springer-Verlag},
	organization = {Springer-Verlag},
	abstract = {
	Version History:\&nbsp;Preliminary version posted as\&nbsp;Cryptology ePrint Archive\&nbsp;Report 2008/097, March 2008.



	We provide a simple protocol for secret reconstruction in any threshold secret sharing scheme, and prove that it is\&nbsp;fair\&nbsp;when executed with many\&nbsp;rational\&nbsp;parties together with a small minority of\&nbsp;honest\&nbsp;parties. That is, all parties will learn the secret with high probability when the honest parties follow the protocol and the rational parties act in their own self-interest (as captured by a set-Nash analogue of trembling hand perfect equilibrium). The protocol only requires a\&nbsp;standard\&nbsp;(synchronous) broadcast channel, tolerates both early stopping and incorrectly computed messages, and only requires 2 rounds of communication.



	Previous protocols for this problem in the cryptographic or economic models have either required an honest majority, used strong communication channels that enable simultaneous exchange of information, or settled for approximate notions of security/equilibria. They all also required a nonconstant number of rounds of communication.

},
	url = {https://link.springer.com/chapter/10.1007/978-3-642-00457-5_3},
	author = {Shien Jin Ong and David Parkes and Alon Rosen and Salil Vadhan}
}
