An Byzantine fault-tolerant consensus algorithm based on MuSig

Pengliu Tan, Wenhao Zeng, Zhihui Tao, Runshu Wang
{"title":"An Byzantine fault-tolerant consensus algorithm based on MuSig","authors":"Pengliu Tan, Wenhao Zeng, Zhihui Tao, Runshu Wang","doi":"10.1109/ICCECE58074.2023.10135286","DOIUrl":null,"url":null,"abstract":"In view of the disadvantages of PBFT consensus algorithm such as large traffic and complicated view change, a Byzantine fault-tolerant consensus algorithm based on MuSig, namely MSBFT consensus algorithm, is proposed. The algorithm adopts multi-signature MuSig and pipeline idea, and optimizes the consensus process, view change protocol and checkpoint protocol. The communication complexity of the consensus process, view change protocol, and check point protocol in MSBFT is reduced from O(n2), O(n3), and O(n2) in PBFT to O(n) respectively. Experimental results show that compared with ABFT, PBFT and SBFT, the consensus efficiency and throughput of MSBFT algorithm are greatly improved.","PeriodicalId":120030,"journal":{"name":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 3rd International Conference on Consumer Electronics and Computer Engineering (ICCECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCECE58074.2023.10135286","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In view of the disadvantages of PBFT consensus algorithm such as large traffic and complicated view change, a Byzantine fault-tolerant consensus algorithm based on MuSig, namely MSBFT consensus algorithm, is proposed. The algorithm adopts multi-signature MuSig and pipeline idea, and optimizes the consensus process, view change protocol and checkpoint protocol. The communication complexity of the consensus process, view change protocol, and check point protocol in MSBFT is reduced from O(n2), O(n3), and O(n2) in PBFT to O(n) respectively. Experimental results show that compared with ABFT, PBFT and SBFT, the consensus efficiency and throughput of MSBFT algorithm are greatly improved.
一种基于MuSig的拜占庭容错共识算法
针对PBFT共识算法流量大、视图变换复杂等缺点,提出了一种基于MuSig的拜占庭容错共识算法,即MSBFT共识算法。该算法采用多签名MuSig和流水线思想,对共识过程、视图变更协议和检查点协议进行了优化。将MSBFT中的共识过程、视图变更协议和检查点协议的通信复杂度分别从PBFT中的0 (n2)、0 (n3)和0 (n2)降低到O(n)。实验结果表明,与ABFT、PBFT和SBFT相比,MSBFT算法的一致性效率和吞吐量都有很大提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信