《计算机应用研究》|Application Research of Computers

结合BLS聚合签名改进实用拜占庭容错共识算法

Improved practical Byzantine fault tolerant consensus algorithm combined with BLS aggregating signature

免费全文下载 (已被下载 次)  
获取PDF全文
作者 陈佳伟,冼祥斌,杨振国,刘文印
机构 广东工业大学 计算机学院,广州 510006
统计 摘要被查看 次,已被下载
文章编号 1001-3695(2021)07-006-1952-04
DOI 10.19734/j.issn.1001-3695.2020.12.0403
摘要 针对实用拜占庭容错(practical Byzantine fault tolerance,PBFT)共识算法运用在联盟链中达到<i>O</i>(<i>n</i><sup>2</sup>)的通信复杂度难以支持大规模网络的问题,提出一种聚合签名的拜占庭容错算法(aggregate-signature byzantine fault tolerance,ABFT)。首先,改进PBFT共识算法中节点的信息交互方式,在prepare阶段各个副本节点单点发送信息及签名给主节点验证,在commit阶段由主节点收集签名并验证,结合BLS(boneh-lynn-shacham)签名将验证通过的多个签名聚合成一个聚合签名,将该聚合签名以及其他必要信息广播给其他所有副本节点验证;此外增加了finish阶段,用于防止大部分的副本节点超时而导致视图变更。ABFT算法将网络通信的复杂度降低为<i>O</i>(<i>n</i>),通过实验表明,在多个节点的情况下,ABFT算法有效地降低了共识的时延且提高了交易吞吐量,可扩展性更优,使联盟链可容纳大量节点。
关键词 区块链; PBFT共识算法; 聚合签名; 吞吐量; 时延
基金项目 国家自然科学基金资助项目(62076073,91748107)
广东省基础与应用基础研究基金资助项目(2020A1515010616)
广东省引进创新科研团队计划资助项目(2014ZT05G157)
本文URL http://www.arocmag.com/article/01-2021-07-006.html
英文标题 Improved practical Byzantine fault tolerant consensus algorithm combined with BLS aggregating signature
作者英文名 Chen Jiawei, Xian Xiangbin, Yang Zhenguo, Liu Wenyin
机构英文名 School of Computers,Guangdong University of Technology,Guangzhou 510006,China
英文摘要 To solve the problem that the PBFT consensus algorithm can't support large-scale network with the quadratic communication complexity of <i>O</i>(<i>n</i><sup>2</sup>)in consortium blockchain, this paper proposed an ABFT algorithm. Firstly, it improved the information interaction mode of nodes in PBFT consensus algorithm on multiple phases. On the prepare phase, each replica node sent information and signatured to the master node for verification. On the commit phase, the master node collected and verified the signatures, and combined with BLS signature, it aggregated the multiple verified signatures into an aggregating signature, which would be broadcast to all other replica nodes with other necessary information for verification. Moreover, ABFT algorithm the added the finish phase to prevent most replica nodes from timing out and causing view change. The ABFT algorithm reduced the complexity of network communication to <i>O</i>(<i>n</i>). Experiments show that in the case of multiple nodes, the ABFT algorithm can effectively reduce the consensus delay and improve the transaction throughput, which makes the consortium blockchain being able to accommodate a large number of nodes.
英文关键词 blockchain; PBFT consensus algorithm; aggregating signature; throughput; time delay
参考文献 查看稿件参考文献
 
收稿日期 2020/12/7
修回日期 2021/1/11
页码 1952-1955,1962
中图分类号 TP301.6
文献标志码 A