A Fair Secure Multi-party Coin-flipping Protocol

摘要：

Designing coin-flipping protocol is one of the foundation problems in cryptography. 1986,Cleve showed that there doesnt 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.

关键词： coin-flipping multi-party coin-flipping time-lines

作者: Ou Ruan Jing Zhou Guohua Cui

作者单位: College of Computer Science & Technology,Huazhong University of Science & Technology,Wuhan,China,430 College of Computer Science & Technology,Hubei University of Technology,Wuhan,China,430068 College of Computer Science & Technology,Huazhong University of Science & Technology,Wuhan,China,430

会议类型: 国际会议

会议名称: 2011 International Conference on Opto-Electronics Engineering and Information Science(2011光电电子工程与信息科学国际会议 ICOEIS 2011)

会议地点: 西安

会议语种:英文

页码: 200-204

在线出版日期: 2011-12-23（万方平台首次上网日期，不代表论文的发表时间）