A PBFT Consensus Algorithm with Dual-master Node
CHEN Heng
HUANG Shicheng
ZHENG Minghui
Abstract：A dual-master node practical Byzantine fault tolerance(DMNPBFT)consensus algorithm with was proposed to solve the problem of centralized authority and low consensus efficiency caused by excessive authority of the master node of Byzantine consensus algorithm in blockchain.The algorithm first determined the power of the dual-master node among the blockchain nodes,and reduced the influence of power concentration caused by centralization through the interaction mode of the dual-master node.In the process of information transaction transmission,the combination of dual-master node and secret sharing technology was used to determine that all nodes in the alliance chain reach a consensus on transaction information,which solved the problem of low consensus efficiency caused by complex information transmission to confirm consensus among the nodes.The dual-master node used the aggregation algorithm in secret sharing to generate the master key,and compared the consistency between the master key and the original key to complete the consensus transaction.The algorithm was safe and robust in computation,and the number of consensus rounds is only 3.The experiments showed the consensus consistency and fault-tolerant processing ability of the scheme were significantly enhanced compared to the traditional PBFT algorithm,and the consensus latency was decreased by 97.7%.The proposed algorithm effectively improves the ability of data processing in alliance chain nodes,and can complete the security consensus transmission operation of data in alliance chain under big data traffic.
Keywords：blockchainconsensus algorithmencryption and decryption algorithmalliance chainsecret sharingsub keysignature algorithm
Publication Date：2024-06-20
Online Publishing Date：2025-08-15(First online date of this platform, not the publication date of the document)
Pages：6( 185-190 )