{"title":"改进的动态拜占庭容错共识机制","authors":"Fei Tang , Jinlan Peng , Ping Wang , Huihui Zhu , 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":"{\"title\":\"Improved dynamic Byzantine Fault Tolerant consensus mechanism\",\"authors\":\"Fei Tang , Jinlan Peng , Ping Wang , Huihui Zhu , 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}","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}
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.
期刊介绍:
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.