Improved dynamic Byzantine Fault Tolerant consensus mechanism

IF 4.5 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Computer Communications Pub Date : 2024-08-08 DOI:10.1016/j.comcom.2024.08.004
Fei Tang , Jinlan Peng , Ping Wang , Huihui Zhu , Tingxian Xu
{"title":"Improved dynamic Byzantine Fault Tolerant consensus mechanism","authors":"Fei Tang ,&nbsp;Jinlan Peng ,&nbsp;Ping Wang ,&nbsp;Huihui Zhu ,&nbsp;Tingxian Xu","doi":"10.1016/j.comcom.2024.08.004","DOIUrl":null,"url":null,"abstract":"<div><p>The Byzantine Fault Tolerance (BFT) consensus protocols are widely used in consortium blockchain to ensure data consistency. However, BFT protocols are generally static which means that the dynamic joining and exiting of nodes will lead to the reconfiguration of the consortium blockchain system. Moreover, most BFT protocols cannot support the clearing operation of slow, crashed, or faulty nodes, which limits the application of consortium blockchain. In order to solve these problems, this paper proposes a new Dynamic Scalable BFT (D-SBFT) protocol. D-SBFT optimizes SBFT by using Distributed Key Generation (DKG) technology and BLS aggregate signature scheme. On the basis of SBFT, we add <em>Join</em>, <em>Exit</em>, and <em>Clear</em> algorithms. Among them, <em>Join</em> and <em>Exit</em> algorithms enable nodes to actively join and exit the consortium blockchain more flexibly. <em>Clear</em> can remove slow, crashed or faulty nodes from the consortium blockchain. Experimental results show that our D-SBFT protocol can efficiently implement node dynamic change while exhibiting good performance in consensus process.</p></div>","PeriodicalId":55224,"journal":{"name":"Computer Communications","volume":"226 ","pages":"Article 107922"},"PeriodicalIF":4.5000,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Communications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0140366424002615","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The Byzantine Fault Tolerance (BFT) consensus protocols are widely used in consortium blockchain to ensure data consistency. However, BFT protocols are generally static which means that the dynamic joining and exiting of nodes will lead to the reconfiguration of the consortium blockchain system. Moreover, most BFT protocols cannot support the clearing operation of slow, crashed, or faulty nodes, which limits the application of consortium blockchain. In order to solve these problems, this paper proposes a new Dynamic Scalable BFT (D-SBFT) protocol. D-SBFT optimizes SBFT by using Distributed Key Generation (DKG) technology and BLS aggregate signature scheme. On the basis of SBFT, we add Join, Exit, and Clear algorithms. Among them, Join and Exit algorithms enable nodes to actively join and exit the consortium blockchain more flexibly. Clear can remove slow, crashed or faulty nodes from the consortium blockchain. Experimental results show that our D-SBFT protocol can efficiently implement node dynamic change while exhibiting good performance in consensus process.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
改进的动态拜占庭容错共识机制
拜占庭容错(BFT)共识协议被广泛应用于联盟区块链,以确保数据一致性。然而,BFT 协议通常是静态的,这意味着节点的动态加入和退出将导致联盟区块链系统的重新配置。此外,大多数 BFT 协议无法支持缓慢、崩溃或故障节点的清算操作,这限制了联盟区块链的应用。为了解决这些问题,本文提出了一种新的动态可扩展 BFT(D-SBFT)协议。D-SBFT 通过使用分布式密钥生成(DKG)技术和 BLS 聚合签名方案对 SBFT 进行了优化。在 SBFT 的基础上,我们增加了加入(Join)、退出(Exit)和清除(Clear)算法。其中,加入和退出算法能让节点更灵活地主动加入和退出联盟区块链。清除算法可以从联盟区块链中清除速度慢、崩溃或有故障的节点。实验结果表明,我们的 D-SBFT 协议可以有效地实现节点动态变化,同时在共识过程中表现出良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Computer Communications
Computer Communications 工程技术-电信学
CiteScore
14.10
自引率
5.00%
发文量
397
审稿时长
66 days
期刊介绍: Computer and Communications networks are key infrastructures of the information society with high socio-economic value as they contribute to the correct operations of many critical services (from healthcare to finance and transportation). Internet is the core of today''s computer-communication infrastructures. This has transformed the Internet, from a robust network for data transfer between computers, to a global, content-rich, communication and information system where contents are increasingly generated by the users, and distributed according to human social relations. Next-generation network technologies, architectures and protocols are therefore required to overcome the limitations of the legacy Internet and add new capabilities and services. The future Internet should be ubiquitous, secure, resilient, and closer to human communication paradigms. Computer Communications is a peer-reviewed international journal that publishes high-quality scientific articles (both theory and practice) and survey papers covering all aspects of future computer communication networks (on all layers, except the physical layer), with a special attention to the evolution of the Internet architecture, protocols, services, and applications.
期刊最新文献
Trustless privacy-preserving data aggregation on Ethereum with hypercube network topology Trajectory design of UAV-aided energy-harvesting relay networks in the terahertz band A dual-tier adaptive one-class classification IDS for emerging cyberthreats Editorial Board A deep dive into cybersecurity solutions for AI-driven IoT-enabled smart cities in advanced communication networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1