With the rapid development of blockchain technology,more and more people are paying attention to the consensus mechanism of blockchain.Practical Byzantine Fault Tolerance(PBFT),as the first efficient consensus algorit...With the rapid development of blockchain technology,more and more people are paying attention to the consensus mechanism of blockchain.Practical Byzantine Fault Tolerance(PBFT),as the first efficient consensus algorithm solving the Byzantine Generals Problem,plays an important role.But PBFT also has its problems.First,it runs in a completely closed environment,and any node can't join or exit without rebooting the system.Second,the communication complexity in the network is as high as O(n2),which makes the algorithm only applicable to small-scale networks.For these problems,this paper proposes an Optimized consensus algorithm,Excellent Practical Byzantine Fault Tolerance(EPBFT),in which nodes can dynamically participate in the network by combining a view change protocol with a node's add or quit request.Besides,in each round of consensus,the algorithm will randomly select a coordination node.Through the cooperation of the primary and the coordination node,we reduce the network communication complexity to O(n).Besides,we have added a reputation credit mechanism and a wrong node removal protocol to the algorithm for clearing the faulty nodes in time and improving the robustness of the system.Finally,we design experiments to compare the performance of the PBFT and EPBFT algorithms.Through experimental,we found that compared with the PBFT algorithm,the EPBFT algorithm has a lower delay,communication complexity,better scalability,and more practical.展开更多
针对联盟链微电网电力交易场景的高吞吐量、高数据安全性及数据透明性的需求,提出一种在贡献值模型下的基于可验证随机函数(Verifiable Random Function,VRF)与基于BLS(Boneh-Lynn-Shacham Threshold Signatures,BLS)门限签名的改进实...针对联盟链微电网电力交易场景的高吞吐量、高数据安全性及数据透明性的需求,提出一种在贡献值模型下的基于可验证随机函数(Verifiable Random Function,VRF)与基于BLS(Boneh-Lynn-Shacham Threshold Signatures,BLS)门限签名的改进实用拜占庭容错共识算法(Contribution Value Model,Verifiable Random Function and Boneh-Lynn-Shacham Threshold Signatures Practical ByzantineFault Tolerance,CVB-PBFT)。CVB-PBFT算法通过贡献值模型筛选高贡献节点参与共识,采用VRF和安全随机函数选举不可预测的主节点,结合节点轮换和检测机制以及BLS签名优化通信流程,显著提高算法的性能和安全性。经实验证明,该算法能够有效防御恶意攻击,降低通信开销,并提升共识效率,满足微电网电力交易对时效性和安全性的要求。展开更多
The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development.To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance(PB...The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development.To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance(PBFT)in IoT scenarios,a hierarchical consensus protocol called DCBFT is proposed.Above all,we propose an improved k-sums algorithm to build a two-level consensus cluster,achieving an hierarchical management for IoT devices.Next,A scalable two-level consensus protocol is proposed,which uses a multi-primary node mechanism to solve the single-point-of-failure problem.In addition,a data synchronization process is introduced to ensure the consistency of block data after view changes.Finally,A dynamic reputation evaluation model is introduced to update the nodes’reputation values and complete the rotation of consensus nodes at the end of each consensus round.The experimental results show that DCBFT has a more robust dynamic and higher consensus efficiency.Moreover,After running for some time,the performance of DCBFT shows some improvement.展开更多
The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to ...The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to support massive network nodes, the common participation over all nodes in the consensus mechanism would lead to increased communication complexity, and the arbitrary selection of master nodes would also lead to inefficient consensus. This paper offered a PBFT consensus method (Role Division-based Practical Byzantine Fault Tolerance, RD-PBFT) to address the above problems based on node role division. First, the nodes in the system voted with each other to divide the high reputation group and low reputation group, and determined the starting reputation value of the nodes. Then, the mobile node in the group was divided into roles according to the high reputation value, and a total of three roles were divided into consensus node, backup node, and supervisory node to reduce the number of nodes involved in the consensus process and reduced the complexity of communication. In addition, an adaptive method was used to select the master nodes in the consensus process, and an integer value was introduced to ensure the unpredictability and equality of the master node selection. Experimentally, it was verified that the algorithm has lower communication complexity and better decentralization characteristics compared with the PBFT consensus algorithm, which improved the efficiency of consensus.展开更多
基金This research was supported by Key Projects of the Ministry of Science and Technology of the People’s Republic of China(2018AAA0102301)Project of Hunan Provincial Science and Technology Department(2017SK2405)CERNET Innovation Project(NGII20170715),(NGII20180902).
文摘With the rapid development of blockchain technology,more and more people are paying attention to the consensus mechanism of blockchain.Practical Byzantine Fault Tolerance(PBFT),as the first efficient consensus algorithm solving the Byzantine Generals Problem,plays an important role.But PBFT also has its problems.First,it runs in a completely closed environment,and any node can't join or exit without rebooting the system.Second,the communication complexity in the network is as high as O(n2),which makes the algorithm only applicable to small-scale networks.For these problems,this paper proposes an Optimized consensus algorithm,Excellent Practical Byzantine Fault Tolerance(EPBFT),in which nodes can dynamically participate in the network by combining a view change protocol with a node's add or quit request.Besides,in each round of consensus,the algorithm will randomly select a coordination node.Through the cooperation of the primary and the coordination node,we reduce the network communication complexity to O(n).Besides,we have added a reputation credit mechanism and a wrong node removal protocol to the algorithm for clearing the faulty nodes in time and improving the robustness of the system.Finally,we design experiments to compare the performance of the PBFT and EPBFT algorithms.Through experimental,we found that compared with the PBFT algorithm,the EPBFT algorithm has a lower delay,communication complexity,better scalability,and more practical.
文摘针对联盟链微电网电力交易场景的高吞吐量、高数据安全性及数据透明性的需求,提出一种在贡献值模型下的基于可验证随机函数(Verifiable Random Function,VRF)与基于BLS(Boneh-Lynn-Shacham Threshold Signatures,BLS)门限签名的改进实用拜占庭容错共识算法(Contribution Value Model,Verifiable Random Function and Boneh-Lynn-Shacham Threshold Signatures Practical ByzantineFault Tolerance,CVB-PBFT)。CVB-PBFT算法通过贡献值模型筛选高贡献节点参与共识,采用VRF和安全随机函数选举不可预测的主节点,结合节点轮换和检测机制以及BLS签名优化通信流程,显著提高算法的性能和安全性。经实验证明,该算法能够有效防御恶意攻击,降低通信开销,并提升共识效率,满足微电网电力交易对时效性和安全性的要求。
基金supported by the Science and Technology Plan Project of Quanzhou City,Fujian Province of China(2022C020R)the Science and Technology Plan Project of Fujian Province of China(2023H0012)。
文摘The inefficiency of Consensus protocols is a significant impediment to blockchain and IoT convergence development.To solve the problems like inefficiency and poor dynamics of the Practical Byzantine Fault Tolerance(PBFT)in IoT scenarios,a hierarchical consensus protocol called DCBFT is proposed.Above all,we propose an improved k-sums algorithm to build a two-level consensus cluster,achieving an hierarchical management for IoT devices.Next,A scalable two-level consensus protocol is proposed,which uses a multi-primary node mechanism to solve the single-point-of-failure problem.In addition,a data synchronization process is introduced to ensure the consistency of block data after view changes.Finally,A dynamic reputation evaluation model is introduced to update the nodes’reputation values and complete the rotation of consensus nodes at the end of each consensus round.The experimental results show that DCBFT has a more robust dynamic and higher consensus efficiency.Moreover,After running for some time,the performance of DCBFT shows some improvement.
文摘The PBFT (Practical Byzantine Fault Tolerance, PBFT) consensus algorithm, which addressed the issue of malicious nodes sending error messages to disrupt the system operation in distributed systems, was challenging to support massive network nodes, the common participation over all nodes in the consensus mechanism would lead to increased communication complexity, and the arbitrary selection of master nodes would also lead to inefficient consensus. This paper offered a PBFT consensus method (Role Division-based Practical Byzantine Fault Tolerance, RD-PBFT) to address the above problems based on node role division. First, the nodes in the system voted with each other to divide the high reputation group and low reputation group, and determined the starting reputation value of the nodes. Then, the mobile node in the group was divided into roles according to the high reputation value, and a total of three roles were divided into consensus node, backup node, and supervisory node to reduce the number of nodes involved in the consensus process and reduced the complexity of communication. In addition, an adaptive method was used to select the master nodes in the consensus process, and an integer value was introduced to ensure the unpredictability and equality of the master node selection. Experimentally, it was verified that the algorithm has lower communication complexity and better decentralization characteristics compared with the PBFT consensus algorithm, which improved the efficiency of consensus.
