PBFT Algorithm Research Articles

RGPBFT: A Reputation-Based PBFT Algorithm with Node Grouping Strategy

RGPBFT: A Reputation-Based PBFT Algorithm with Node Grouping Strategy

Zebra: A cluster-aware blockchain consensus algorithm

The Consensus algorithm is the core of the permissioned blockchain, it directly affects the performance and scalability of the system. Performance is limited by the computing power and network bandwidth of a single leader node. Most existing blockchain systems adopt mesh or star topology. Blockchain performance decreases rapidly as the number of nodes increases. To solve this problem, we first design the n-k cluster tree and corresponding generation algorithm, which supports rapid reconfiguration of nodes. Then we propose the Zebra consensus algorithm, which is a cluster tree-based consensus algorithm. Compared to the PBFT, it has higher throughput and supports more nodes under the same hardware conditions. However, the tree network topology enhances scalability while also increasing latency among nodes. To reduce transaction latency, we designed the Pipeline-Zebra consensus algorithm that further improves the performance of blockchain systems in a tree network topology through parallel message propagation and block validation. The message complexity of the algorithm is O(n). Experimental results show that the performance of the algorithm proposed in this paper can reach 2.25 times that of the PBFT algorithm, and it supports four times the number of nodes under the same hardware.

Improved PBFT Algorithm Based on Reputations Synchronization and Group Consensus

Improved PBFT Algorithm Based on Reputations Synchronization and Group Consensus

Blockchain-based secure optimized traceable scheme for smart and sustainable food supply chain

A large number of nodes, and significant system overhead are among the challenges. To tackle these problems, a new PBFT technique known as trace-PBFT (t-PBFT) is being contemplated for adoption in the food supply chain. The PBFT algorithm, short for Practical Byzantine Fault Tolerance, serves as the fundamental algorithm. The linkages throughout the supply chain may be categorized into three primary groups. As a response to the continuing discussion over the amount of data, the status of each node is continuously updated in real time. This metric is utilized to evaluate the dependability of the principal node and to analyze the overall performance of the nodes. To minimize the amount of data transmitted between nodes, we optimized the consensus process of the first algorithm. The distinct attributes of offering collaborative food technology were considered throughout this procedure. Experimental evidence indicates that the t-PBFT approach outperforms the PBFT algorithm in terms of throughput, request delay, and information overhead. An architectural paradigm is proposed by integrating the t-PBFT algorithm with a federated network. This model was developed in response to the distinct demands of the food supply chain. This model effectively captures data at each stage of the food supply chain to ensure information tracking while preserving the safety of the food technology flow process.

Adaptive Clustering Hierarchical PBFT Algorithm for Secure and Efficient Blockchain-based IoT Edge Computing

Adaptive Clustering Hierarchical PBFT Algorithm for Secure and Efficient Blockchain-based IoT Edge Computing

Digital Transformation Strategy of Enterprise Financial Accounting Management Based on Blockchain Technology

Abstract This paper focuses on using blockchain technology for the digital transformation of enterprise financial accounting management to improve the security and reliability of data management. This paper makes a comparative analysis of PBFT algorithm and RPBFT algorithm, and uses blockchain technology to store data and monitor each node dynamically. The effect of financial management after digital transformation is remarkable. Taking Company A as an example, its operating profit margin increased from 12.13% to 26.0%, an increase of 13.87%. In terms of financial performance, the expenditure of Enterprise A between 2021 and 2022 increased from 15 billion yuan to 17.21 billion yuan. In addition, in terms of the management expense rate, the operating income of enterprise A in 2022 reached 185.828 billion yuan, which decreased by 0.74% compared with the expense rate 2020. The digital transformation strategy not only creates higher value for the enterprise, but also realizes the interconnection and sharing of data. This strategy has important practical significance to guide enterprises in the digital era of financial accounting management, which helps enterprises to maintain advantages in the fierce market competition, while ensuring data security and efficient management.

Blockchain and trusted reputation assessment-based incentive mechanism for healthcare services

Blockchain-based healthcare IoT technology research enhances security for smart healthcare services such as real-time monitoring and remote disease diagnosis. To incentivize positive behavior among participants within a blockchain-based smart healthcare system, existing efforts employ benefit distribution and reputation assessment methods to enhance performance. Yet, there remains a significant gap in multidimensional assessment strategies and consensus improvements in addressing complex healthcare scenarios. In this paper, we propose a blockchain and trusted reputation assessment-based incentive mechanism for healthcare services (BtRaI). BtRaI provides a realistic and comprehensive reputation assessment with feedback to motivate blockchain consensus node participation, thus effectively defending against malicious behavior in the healthcare service system. Specifically, BtRaI first introduces multiple moderation factors for comprehensive multidimensional reputation assessment and credibly records the assessment results on the blockchain. Then, we propose an improved PBFT algorithm, grounded in the reputation assessment, to augment blockchain consensus efficiency. Finally, BtRaI designs a token-based reward and punishment mechanism to motivate honest participation in the blockchain, inhibit potential misbehavior, and promote enhanced service quality in the healthcare system. Theoretical analysis and simulation experiments conducted across various scenarios demonstrate that BtRaI effectively suppresses malicious attacks in healthcare services, improves blockchain node fault tolerance rates, and achieves blockchain transaction processing efficiency within 0.5 s in a 100-node consortium chain. BtRaI’s reputation assessment and token incentive mechanism, characterized by realistic differentiation granularity and change curves, are well-suited for dynamic and complex healthcare service environments.

Creation a Blockchain-based Product Qualification System for E-Marketplace using Practical Byzantine Fault Tolerance Algorithm

An indicator of e-marketplace effectiveness is to facilitate transparent transactions between sellers and buyers by offering good products and adequate infrastructure to handle system requirements. A good product must be in accordance with the product qualification which consists of the classification of feasibility or not, and the benefits of the product. However, this often has problems including those caused by frequent problematic system conditions, non-transparent product qualifications, undistributed data, human error until data security. The researcher proposes the creation of a product qualification system for e-marketplace using blockchain technology. The product qualification system consists of data verification and validation carried out by stakeholders involved in the decentralized network. Transactions that have been executed and validated will be stored in the distributed ledger. The focus of this research is the implementation of blockchain that is allowed to use the PBFT algorithm on product qualification records in the e-marketplace. The purpose of this research is to create a blockchain-based product qualification system for e-marketplace that is transparent and immutable and the successful performance of the system in information storage and management security. The results show the creation of a web-based apps product qualification system that implements a blockchain using Hyperledger Fabric and the performance obtained through system testing and data validation testing.

Improvement of Hierarchical Byzantine Fault Tolerance Algorithm in RAFT Consensus Algorithm Election

Currently, blockchain technology is not only gaining momentum in the financial industry but also showing promising developments in other sectors. Due to its suitability for various societal needs, an increasing number of non-financial institutions are expanding the scope of blockchain services beyond finance to areas such as healthcare service management and enterprise governance. The core of a blockchain system lies in consensus, which plays a crucial role in its performance and security. The PBFT algorithm is a widely used fault-tolerant consensus algorithm. However, it suffers from issues like high consensus latency, low throughput, and poor performance. In recent years, the HBFT algorithm has addressed these concerns. This paper proposes an improved HBFT blockchain consensus algorithm tailored for large enterprises and non-financial institutions with multiple independent functions. The goal is to achieve more efficient data management and election strategies that are both more secure than PBFT and more efficient than HBFT. Leveraging the enhanced HBFT consensus algorithm ensures stability and efficiency in the consensus and verification processes between organizations. Additionally, it enables the efficient management of data and value creation in the application context.

Secure and efficient blockchain-based consensus scheme for MWSNs with clustered architecture

Blockchain has proven in sensor networks as a distributed solution for transparent and secure storage, which allows its application in mobile wireless sensor networks (MWSNs). The consensus mechanism, an essential aspect of blockchain technology, must concern the high mobility, resource-constrained nature, and weak physical defenses of sensor nodes in MWSNs. To secure MWSN data storage in clustered communication, we design a proof-of-information (PoI) variant for fair miner campaigning via the amount of valid data generated from environmental information, including a dynamic adjustment of the data volume threshold to detect malicious nodes and prevent them from misreporting information. Additionally, we introduce a filtering mechanism through the dynamic integrated trust (DIt) of nodes, which integrates the trust evaluation of peer nodes across the network combining objective performance to prevent malicious nodes from infiltrating the final consensus group. The multi-level filtering technique improves the campaign fairness while isolating malicious nodes, ensuring complexity-sensitive PBFT algorithm efficiency in large-scale networks. Simulation results show that the scheme isolates 90% of the malicious nodes and screens 20% of members to produce a smaller final consensus group. Further analysis of impacts on the performance considering network topology and mobility patterns and comparisons of the relevant solutions are presented.

Design of improved PBFT algorithm based on aggregate signature and node reputation

Design of improved PBFT algorithm based on aggregate signature and node reputation

An Improved Byzantine Fault-Tolerant Algorithm Based on Reputation Model

This study proposes an improved Byzantine fault-tolerant consensus RB-BFT based on the reputation model to address the problems of low reliability of primary nodes and high communication complexity in the practical Byzantine algorithm (PBFT). First, this algorithm establishes a dynamic reputation model of nodes to distinguish honest and malicious nodes in the system, lowering the likelihood of malicious nodes being chosen as primary nodes and increasing the dependability of primary nodes. Second, the algorithm introduces supervisory nodes for information supervision while reducing the centrality of the system. Finally, this algorithm improves the consistency protocol of the PBFT algorithm by optimizing the process of mutual communication between nodes in the preparation and commitment phases, which reduces the algorithm communication complexity from O(n2) to O(n). Theoretical and practical studies reveal that the RB-BFT algorithm enhances performance and reliability greatly.

Research on carbon flow traceability system for distribution network based on blockchain and power flow calculation

With the proposal of the two-carbon goal, energy conservation and emission reduction will become the focus of China’s energy system in the future for a long time to come. The establishment of a complete and efficient carbon traceability system will play an important role in promoting carbon emission reduction in the power system. Based on blockchain, this paper uses the consensus mechanism, time stamp, decentralization features, smart contract and other functions of blockchain, combined with the power flow calculation and the characteristics related to carbon emission and active power of the generator set, to obtain the corresponding carbon emission intensity of the generator set and carbon flow rate. It realizes the calculation and tracing of carbon emission flow in power distribution network and ensures the reliability of carbon traceability results, high efficiency of information transmission and transparency of traceability process. Firstly, based on the characteristics of the master-slave multi-chain structure in the consortium chain, In this paper, high-voltage substation nodes are the main chain nodes, and carbon flow tracing and calculation are carried out for the associated low-voltage substations, and the information of high-voltage or low-voltage substation nodes is guaranteed to be tamper-free through the hash anchoring method. The master-slave multi-chain model adopted in this paper is that the main chain adopts EA-DPoS (Evaluation and Agent-DPoS) algorithm, the slave chain adopts improved PBFT algorithm, and the comprehensive evaluation and reward and punishment mechanism are introduced to complete the consensus. Secondly, considering the security requirements of the power system data and the fact that some nodes of the distribution network do not have powerful computing resources comparable to those of the power grid company or major nodes, this paper encrypts and decrypts relevant data in the main chain node by combining the smart contract of blockchain. Meanwhile, cloud service providers with computing resources are responsible for generator power distribution combined with power flow calculation and carbon emission intensity calculation of the generator set. The power grid company adopts the cloud computing framework based on the double check mechanism to calculate the carbon flow rate while verifying the correct calculation results of the cloud service provider, and finally realizes the safe and accurate tracing of the carbon flow of the distribution network.

Design of Proof-of-Stake PBFT Algorithm for IoT Environments

Blockchain ledgers are being increasingly used in Internet of Things (IoT) and Internet of Vehicles (IoV) applications. However, Proof of Work consensus is unsuitable in an IoV setting, which is why other paradigms need to be investigated. In this work we integrate Proof of Stake (PoS) consensus technique with multiple entry Practical Byzantine Fault Tolerance voting in a permissioned blockchain network. We introduce several PoS classes based on combination of initial stake and truthfulness of voting. We also describe a differentiated medium access approach similar to Enhanced Distribution Function (EDCA). Using a Semi Markov Process-based model, we derive the probability of reaching consensus and highlight the impact of the populations of individual stake/priority classes on achieving consensus. Our results show the impact of numbers of nodes from classes with different voting behavior on consensus probability. Results also show differentiation through the number of blocks linked per second, success probability in leadership application and delay in leader selection for node belonging to certain class. These values show how much revenue a node from given class can collect from its clients depending on initial stake and voting behavior.

Research on the path of integrating blockchain technology into the teaching of film and television courses in higher education institutions

Abstract With the development and popularity of the Internet, blockchain technology is gradually integrated into the teaching of film and television courses in higher education institutions, and how to use blockchain technology for teaching has become a new research hotspot. This paper takes PBFT algorithm as the theoretical basis and constructs PBFT-blockchain model. The teaching situation of film and television courses and the teaching path of film and television courses are studied in depth. The calculation results show that the number of traditional courses is relatively single, and the satisfaction of teachers and students is only 15.2%. The calculation result of film and television resources is “scarce”. The satisfaction rate of students and teachers was only 18.3%. The highest satisfaction rate of students and teachers is the length of teaching, which is 41.4%. It is calculated that the weight of teaching strategy in the teaching path is 67%, and the proportion of teaching results under this weight is 78%. The weight of teaching format in the teaching path is 58%, and the corresponding teaching outcomes under this weight is 84%. The highest weight in the teaching path is the teaching session. Its weight is 83%, and the teaching outcome is 91%. Through the PBFT-blockchain teaching model, two designs of teaching sessions are proposed: problem/event-initiated teaching and material-initiated teaching.

Improved PBFT Algorithm Based on K-Means Clustering for Emergency Scenario Swarm Robotic Systems

Improved PBFT Algorithm Based on K-Means Clustering for Emergency Scenario Swarm Robotic Systems

Online Music Teaching Resource Sharing Algorithm Based on Blockchain Technology

Blockchain technology provides technical support for cloud computing data sharing in data storage and data access, and ensures the safe and effective transmission of data sharing. The online music teaching resource platform based on blockchain technology faces the problems of low data throughput, large delay and unstable performance. Therefore, a blockchain-based sharing algorithm (Practical Byzantine Fault Tolerance, PBFT), PBFT algorithm is proposed. Consensus allows 1/3 of cheating points in the blockchain, and authenticated transactions are confirmed through a confirmation mechanism to ensure data security. However, the traditional PBFT algorithm lacks an efficient node joining and exiting mechanism, and has problems such as low data throughput. Therefore, on the basis of the traditional PBFT algorithm, a blockchain sharing algorithm (WBFT) that improves the weighted Byzantine fault tolerance mechanism is proposed. A weighting mechanism is added in the consensus process. After the consensus, the node behavior will dynamically adjust the weights to reduce the adverse impact of malicious nodes on the data and improve the overall data sharing effect. Experimental performance tests show that the improved WBFT algorithm performs best in multi-algorithm delay performance tests. In the data average throughput test, the performance of the improved WBFT algorithm is 20.2% higher than that of the traditional PBFT algorithm. In the security test, the improved WBFT algorithm has the best performance. The proposed improved WBFT algorithm can well meet the needs of building an online music teaching resource sharing platform. The research content has important reference value for the application of blockchain technology in the education industry, and is conducive to promoting the development of modern education.

An improved scheme of practical Byzantine fault tolerant algorithm

Blockchain technology has become the hottest technology in the market because of its characteristics such as decentralization and data tamper resistance. With the development of blockchain, it is widely used in many fields. There are many types of blockchain, such as alliance chain, private chain and public chain. At present, the alliance chain has attracted extensive attention, but the commonly used PBFT algorithm still has many problems. In order to solve the high communication overhead and low efciency of PBFT consensus echanism, an improved PBFT consensus algorithm with a reputation mechanism are proposed in this paper. Diff erent permissions of nodes are made according to their diff erent reputation levels. Only the nodes with high reputation are qualifed to act as master nodes. Nodes with low reputation will be prohibited from participating in the consistency protocol and reduce the probability of becoming master nodes. In our scheme, the security, efciency and throughput of the consensus algorithm are improved, and the communication cost is reduced.

EIoT-PBFT: A multi-stage consensus algorithm for IoT edge computing based on PBFT

With the introduction of edge computing into the field of Internet of Things (IoT), the Cognitive Internet of Things (CIoT) has emerged as the next-generation solution for trust and intelligent reasoning in the IoT. That also puts blockchain, with its unique consensus mechanism, transparency and trustworthiness, on the stage of IoT applications. At present, not much research is focused on blockchain's application in CIoT, whose development is to a large extent restricted by the inefficiency of the consensus algorithm. Considering the characteristics of CIoT, a multi-stage consensus algorithm of EIoT-PBFT is proposed on the basis of PBFT algorithm, which includes the Grouping stage, Scoring stage and Consensus reaching stage. EIoT-PBFT meets the IoT edge computing setup by adopting a two-phase improved PBFT algorithm and a scoring mechanism based on both location and reputation, thus achieving a great increase in consensus efficiency. Evaluation results show that EIoT-PBFT takes 36.4% less time than PBFT for a single consensus, and the performance remains stable over the 2500 node configurations we set up. Moreover, at a scale of 1000 nodes, the number of edge nodes to be configured to reduce the number of system communications by 90% compared to the PBFT algorithm is only 5, making blockchain more customized for CIoT settings.

GPBFT: A Practical Byzantine Fault-Tolerant Consensus Algorithm Based on Dual Administrator Short Group Signatures

The practical Byzantine fault-tolerant consensus algorithm reduces the operational complexity of Byzantine protocols from an exponential level to a polynomial level, which makes it possible to apply Byzantine protocols in distributed systems. However, it still has some problems, such as high communication overhead, low security, poor scalability, and difficulty in tracking. In this article, we propose a Byzantine fault-tolerant consensus algorithm based on dual administrator short group signatures (GPBFT). Firstly, the certification authority chooses the master node and group administrators based on the credit value. The group administrators organize the nodes into a group, and the members generate the signatures by applying the short group signatures scheme, in which any group member can represent the group during the GroupSign phase. Additionally, the GPBFT algorithm adds the Trace phase. According to member and client authentication information, the group administrator can track the true identity of the malicious node, identify the malicious node, and revoke it. The experimental results show that compared with the PBFT algorithm, the GPBFT algorithm can reduce the network communication overhead, reduce the consensus delay, and greatly improve the security and stability of the system. The algorithm can effectively manage member nodes and enable the tracking of identified malicious nodes while maintaining anonymity in terms of node tracking.