摘要
实用拜占庭容错(practical Byzantine fault tolerance, PBFT)算法应用于联盟链中,存在主节点选取随意、通信开销大等问题.为了解决这些问题,提出了基于节点识别的改进拜占庭容错共识算法(NR-PBFT).首先,通过引入BLS聚合签名优化一致性过程;其次,利用CatBoost算法识别节点,选择高信誉节点为主节点,并动态处理低信誉节点.实验结果显示NR-PBFT在安全性、吞吐量和时延等方面优于PBFT和ABFT算法.
The practical Byzantine fault tolerance(PBFT)algorithm applied to the alliance chain has some problems,such as arbitrary selection of master nodes and high communication overhead.To solve these problems,an improved Byzantine fault-tolerant consensus algorithm(NR-PBFT)based on node recognition is proposed.Firstly,the consistency process is optimized by introducing BLS aggregate signature.Secondly,CatBoost algorithm is used to identify nodes,select high-reputation nodes as the primary nodes,and dynamically process low-reputation nodes.Experimental results show that NR-PBFT is superior to PBFT and ABFT in security,throughput and delay.
作者
张学旺
罗欣悦
雷志滔
陈思宇
Zhang Xuewang;Luo Xinyue;Lei Zhitao;Chen Siyu(School of Software Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065)
出处
《信息安全研究》
CSCD
北大核心
2024年第9期818-823,共6页
Journal of Information Security Research
基金
重庆市城市管理科研项目(城管科字2023第35号)
渝北区社会事业与民生保障科技创新专项重点项目(2021(农社)18)。
