{"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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
