Protocols for Multiparty Coin Toss with Dishonest Majority
- Cite this paper as:
- Beimel A., Omri E., Orlov I. (2010) Protocols for Multiparty Coin Toss with Dishonest Majority. In: Rabin T. (eds) Advances in Cryptology – CRYPTO 2010. CRYPTO 2010. Lecture Notes in Computer Science, vol 6223. Springer, Berlin, Heidelberg
Coin-tossing protocols are protocols that generate a random bit with uniform distribution. These protocols are used as a building block in many cryptographic protocols. Cleve [STOC 1986] has shown that if at least half of the parties can be malicious, then, in any Open image in new window-round coin-tossing protocol, the malicious parties can cause a bias of Open image in new window to the bit that the honest parties output. However, for more than two decades the best known protocols had bias Open image in new window, where Open image in new window is the number of corrupted parties. Recently, in a surprising result, Moran, Naor, and Segev [TCC 2009] have shown that there is an Open image in new window-round two-party coin-tossing protocol with the optimal bias of Open image in new window. We extend Moran et al. results to the multiparty model when less than 2/3 of the parties are malicious. The bias of our protocol is proportional to Open image in new window and depends on the gap between the number of malicious parties and the number of honest parties in the protocol. Specifically, for a constant number of parties or when the number of malicious parties is somewhat larger than half, we present an Open image in new window-round Open image in new window-party coin-tossing protocol with optimal bias of Open image in new window.