Designing coin-flipping protocol is one of the foundation problems in cryptography. 1986,Cleve showed that there doesn't exist completely fair secure coin-Hipping protocol when at least half of parties are malicious. From then on there were few papers discussed fairness(or some form of fairness) of coin-flipping protocol for more than two decades. In TCC 2009,based on the notion of 1/p-secure computation introduced by Katz ,Moran et al. constructed an r-round 1/p-secure two-party coinflipping protocol with bias 0(1 / r).2010,Beimel et al. extended Moran et al. results to multi-party model when less than 2/3 of the parties are malicious. In this paper,we introduce another appraoch for coin-flipping protocol construction by using Garay et al.'s time-lines technique,and construct a fair secure multiparty coin-flipping protocol. Compared to the other coin-flipping protocols,our protocol enjoys two important advantages that its bias is 0 and there is no limitation of number of the malious parties.
展开▼
