南京师范大学学报（工程技术版）2023，Vol.23Issue(4)：10-18,9.DOI:10.3969/j.issn.1672-1292.2023.04.002
基于门限签名及信誉分组的TRBFT共识算法
TRBFT Consensus Algorithm Based on Threshold Signature and Reputation Grouping
摘要
Abstract
Based on the rapid development of the internet and the growing urgent demand for privacy protection,blockchain technology has become increasingly more popular and developed in the field of information sharing and trust,and the consensus algorithm,as the underlying key technology of blockchain,its efficiency determines the quality of blockchain application.Since the proposal the PBFT algorithm,there have been many improvement schemes based on it,but the effect of various PBFT optimization schemes in poor network real-time and multi-node scenarios is still unsatisfactory.Layering based on Raft algorithm,this paper proposes a low delay and high robustness threshold signature Raft Byzantine fault tolerance(TRBFT)by introducing BLS threshold signature into the leadership consensus process.Meanwhile,a dynamicgrouping strategy based on reputation value is proposed to avoid the situation that most Byzantine nodes appear in the same group,which improves the security of the scheme and further ensures the liveness of the algorithm.Finally,the experimental test results of the simulation environment show that the TRBFT has a better performance and a higher scalability compared with the original PBFT in the environment of poor network performance and more nodes.关键词
区块链/共识算法/门限签名/信誉分组/RaftKey words
blockchain/consensus algorithm/threshold signature/reputation grouping/Raft分类
信息技术与安全科学引用本文复制引用
刘金涛,沈丽敏..基于门限签名及信誉分组的TRBFT共识算法[J].南京师范大学学报（工程技术版）,2023,23(4):10-18,9.基金项目
国家自然科学基金青年基金项目(61802195). （61802195）
