Byzantine Fault Tolerance Algorithm Research Articles

Artwork Traceability and Anti-Counterfeiting Model Based on Block Chain Technology

The Chinese art market fostered the advancement of culture and spirituality. Nevertheless, false and counterfeit artwork is not uncommon. The art technology and security introduce the innovative method to determine Artwork Traceability and Anti-Counterfeiting. The aim of the work is to prevent the creation and circulation of fake or unauthorized copies of artworks. Because of the cryptographic security and immutability of block chains, it would be challenging to falsify artwork records or make accurate duplicates. This would foster confidence in the art market and shield collectors and artists from monetary losses and harm to their reputations. The data on mobile Application Data Center (ADC) platform and the cleansing the data using sub-aperture keystone transform matched filtering (SAKTMF) and the preprocessed data is fed into the Hierarchically Gated Recurrent Neural Network (HGRNN) classify the art work and Anti-Counterfeiting. The Bald Eagle Search Optimization (BES) Algorithm is used to optimize the weight parameter of HGRNN. The proposed model is implemented in MATLAB/ Simulink platform and the accuracy is compared to various existing approaches such as Dual-Branch Multi-Scale Feature Fusion network (DMF-Net), Region Convolutional Neural Network (R-CNN) and practical Byzantine fault tolerance (PBFT) algorithm. The gained results of the proposed HGRNN-BES method attains higher accuracy 97%, 96%, and 99%, higher precision 98%, 99%, and 97%.

CE-PBFT: An Optimized PBFT Consensus Algorithm for Microgrid Power Trading

Currently, in the blockchain-based distributed microgrid trading system, there are some problems, such as low throughput, high delay, and a high communication overhead. To this end, an improved Practical Byzantine Fault Tolerance (PBFT) algorithm (CE-PBFT) suitable for microgrid power trading is proposed. First, a node credit value calculation model is introduced, and nodes are divided into consensus, supervisory, and propagation nodes according to their credit values, forming a hierarchical network structure to ensure the efficiency and reliability of consensus. Secondly, the consensus process is optimized by adopting a segmented consensus mechanism. This approach calculates the consensus rounds for nodes and selects the methods for node-type switching and consensus based on these calculations, reaching dynamic changes in node states and credit values, effectively reducing the communication overhead of node consensus. Finally, the experiments show that compared with the IMPBFT and PBFT algorithms, the CE-PBFT algorithm has better performance in throughput, delay, and communication overhead, with a 22% higher average throughput and 15% lower average delay than the IMPBFT algorithm and a 118% higher average throughput and 87% lower average delay than the PBFT algorithm.

A blockchain-based data storage architecture for Internet of Vehicles: Delay-aware consensus and data query algorithms

The recent development of the Internet of Vehicles (IoV) relies heavily on the secure store and analysis of reliable driving data. Blockchain technology has been widely used in the IoV field due to its security advantages, where consensus and query algorithms are two key modules determining its performance. However, existing solutions do not perform well enough in terms of delay performance, thus limiting their ability to support IoV environments with ultra-low-latency requirements. To address this challenge, we design a blockchain-based data storage architecture, focusing on the design of delay-aware consensus and data query algorithms. Specifically, to reduce the consensus delay, we propose a reputation-assisted and grouping-simplified Practical Byzantine Fault Tolerant (RGS-PBFT) algorithm. First, we develop a novel node credit value evaluation model by combining the behavior and configuration reputation to select the primary node with both high security and high computing capacity. Second, after determining the primary node, we reduce the communication complexity of traditional PBFT from O(Z2) to O(Z43) by establishing a grouping-simplified consensus structure. These contributions effectively reduce the consensus delay. To reduce the query delay and index construction time, we propose an index query algorithm based on the data tracking chain (DTC-Index query). By introducing the LevelDB database, it establishes a transaction index chain coupled to vehicle ID in the blockchain. This approach avoids the time-consuming block traversal during data querying. Experimental results demonstrate that the proposed algorithms outperform existing solutions, achieving significant improvements in both consensus delay and query time reduction. Notably, our solutions offer exceptional delay performance, making them well-suited for IoV environments.

CG-PBFT: an efficient PBFT algorithm based on credit grouping

Because of its excellent properties of fault tolerance, efficiency and availability, the practical Byzantine fault tolerance (PBFT) algorithm has become the mainstream consensus algorithm in blockchain. However, current PBFT algorithms have problems such as inadequate security of primary node selection, high communication overhead and network delay in the process of consensus. To address these problems, we design a novel efficient Byzantine fault tolerance algorithm based on credit grouping, called CG-PBFT. First, we propose a new credit evaluation model to obtain nodes’ credit values and introduce an optimized three-way quick sorting algorithm to divide nodes into the master-node group, the consensus-node group and the observation-node group, which have different privileges. The nodes in the observation-node group are restricted from participating in consensus, which reduces the communication overhead and improves consensus efficiency. Second, we propose an optimized selection method for the primary node based on a voting mechanism whereby the consensus-node group and observation-node group vote to produce the primary node, which reduces the probability of malicious nodes acting as the primary node and improves the security of primary node selection. Finally, the identity conversion mechanism between node groups is designed, and the actual behavior of nodes within different groups is given credit rewards or punishment, so as to keep an incentive for nodes to participate in appropriate system behavior and improve the working enthusiasm of nodes. The experimental simulation results show that compared with existing PBFT algorithms, the CG-PBFT algorithm improves the average throughput by 51.3% and reduces the average delay by 64.5%; it greatly improves the operating efficiency of the system and can be more suitable for application in the consortium blockchain scenarios.

Optimizing Blockchain Consensus: Incorporating Trust Value in the Practical Byzantine Fault Tolerance Algorithm with Boneh-Lynn-Shacham Aggregate Signature

The consensus algorithm is the core mechanism of blockchain and is used to ensure data consistency among blockchain nodes. The PBFT consensus algorithm is widely used in alliance chains because it is resistant to Byzantine errors. However, the present PBFT (Practical Byzantine Fault Tolerance) still has issues with master node selection that is random and complicated communication. The IBFT consensus technique, which is enhanced, is proposed in this study and is based on node trust value and BLS (Boneh-Lynn-Shacham) aggregate signature. In IBFT, multi-level indicators are used to calculate the trust value of each node, and some nodes are selected to take part in network consensus as a result of this calculation. The master node is chosen from among them based on which node has the highest trust value, it transforms the BLS signature process into the information interaction process between nodes. Consequently, communication complexity is reduced, and node-to-node information exchange remains secure. The simulation experiment findings demonstrate that the IBFT consensus method enhances transaction throughput rate by 61% and reduces latency by 13% when compared to the PBFT algorithm.

Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus Algorithms

Byzantine fault-tolerant (BFT) consensus algorithms are at the core of providing safety and liveness guarantees for distributed systems that must operate in the presence of arbitrary failures. Recently, numerous new BFT algorithms have been proposed, not least due to the traction blockchain technologies have garnered in the search for consensus solutions that offer high throughput, low latency, and robust system designs. In this article, we conduct a systematic survey of selected and distinguished BFT algorithms that have received extensive attention in academia and industry alike. We perform a qualitative comparison among all algorithms we review considering message and time complexities. Furthermore, we provide a comprehensive, step-by-step description of each surveyed algorithm by decomposing them into constituent subprotocols with intuitive figures to illustrate the message-passing pattern. We also elaborate on the strengths and weaknesses of each algorithm compared to the other state-of-the-art approaches.

BOppCL: Blockchain-Enabled Opportunistic Federated Learning Applied in Intelligent Transportation Systems

In this paper, we present a novel blockchain-enabled approach to opportunistic federated learning (OppCL) for intelligent transportation systems (ITS). Our approach integrates blockchain with OppCL to streamline the learning of autonomous vehicle models while addressing data privacy and trust challenges. We deploy resilient countermeasures, incentivized mechanisms, and a secure gradient distribution to combat single-point failure verification attacks. Additionally, we integrate the Byzantine fault-tolerant algorithm (BFT) into the node verification component of the delegated proof of stake (DPoS) to minimize verification delays. We validate our approach through experiments on the MNIST, SVHN, and CIFAR-10 datasets, showing convergence rates and prediction accuracy comparable to traditional OppCL approaches.

A Survey of Blockchain in Governance: Framework Selection and Future Implementation in Indonesian Government

Blockchain technology enables users to connect without the need for a third party or central server. This is achieved through the use of a decentralized system, ensuring that all data and information transacted are encrypted, verified, validated, and stored using mathematical consensus algorithms. This leads to blockchain being recognized as a technology characterized by decentralization, security, anonymity, transparency, immutable data, and trust. Blockchain is frequently associated with digital currency, although digital currency is just one of the outcomes of applying blockchain technology, resulting in cryptocurrencies. Currently, blockchain technology is a trend among academics and practitioners who are researching and developing blockchain technology for application in various domains, including government. Government systems and public servants often encounter issues related to data security. Hence, the research has the purpose to offer comprehension and perspectives on implementing blockchain technology within the government sector to enhance public service information security. The research was carried out by reviewing Scopus-indexed international articles published between 2019 and 2023, which are relevant to frameworks, consensus algorithms, and applications employed in the governmental domain. The research outcomes revealed that the Hyperledger Fabric framework, coupled with the Practical Byzantine Fault Tolerance (PBFT) algorithm, is the most suitable option for potentially developing blockchain-based government or public service applications for future implementation. Regarding this research, there are future challenges in the form of constructing prototypes and evaluating their effectiveness and efficiency. Therefore, further research and development efforts are essential to ensure that the application of blockchain technology in the government sector can be realized as required in the future.

An Optimized Byzantine Fault Tolerance Algorithm for Medical Data Security

Medical data are an intangible asset and an important resource for the entire society. The mining and application of medical data can generate enormous value. Currently, medical data management is mostly centralized and heavily relies on central servers, which are prone to malfunctions or malicious attacks, making it difficult to form a consensus among multiple parties and achieve secure sharing. Blockchain technology offers a solution to enhance medical data security. However, in medical data security sharing schemes based on blockchain, the widely adopted Practical Byzantine Fault-Tolerant (PBFT) algorithm encounters challenges, including intricate communication, limited scalability, and the inability to dynamically add or remove nodes. These issues make it challenging to address practical requirements effectively. In this paper, we implement an efficient and scalable consensus algorithm based on the PBFT consensus algorithm, referred to as Me-PBFT, which is more suitable for the field of medical data security. First, we design a reputation evaluation model to select more trusted nodes to participate in the system consensus, which is implemented based on a sigmoid function with adjustable difficulty. Second, we implement the division of node roles to construct a dual consensus layer structure. Finally, we design a node dynamic join and exit mechanism on the overall framework of the algorithm. Analysis shows that compared to PBFT and RAFT, ME-PBFT can reduce communication complexity, improve fault tolerance, and have good scalability. It can meet the need for consensus and secure sharing of medical data among multiple parties.

Use of Blockchain technology for the exchange and secure transmission of medical images in the cloud: Systematic Review with Bibliometric Analysis

The research questions focused on emerging challenges, solutions, approaches, encryption methods, architectures, and opportunities related to blockchain technology in medical image sharing, and a total of 17 relevant articles were selected from the Scopus database for analysis. The increasing adoption of cloud computing environments in the medical field has raised concerns about security and privacy risks. Within these concerns, problems were identified regarding secure data storage, since centralized storage systems in the cloud mostly lack security effectiveness. Blockchain technology offers a decentralized and secure infrastructure to address these problems. However, a systematic review is needed to identify the strengths and limitations of this technology in this context, therefore the objective of this review is to provide a critical and updated view of the security aspects of the use of blockchain technology in the exchange of medical images in the cloud. The proposed solutions included practical byzantine fault tolerance algorithms, homomorphic encryption, and the integration of smart contracts, among others. In conclusion, this review provides insight into the application of blockchain technology for the secure sharing of medical images in the cloud and identifies key technologies, challenges, solutions, and opportunities in the field.

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.

Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus Algorithm Optimized for Digital Asset Trading Scenarios.

Based on the practical Byzantine fault tolerance algorithm (PBFT), a grouped multilayer PBFT consensus algorithm (GM-PBFT) is proposed to be applied to digital asset transactions in view of the problems with excessive communication complexity and low consensus efficiency found in the current consensus mechanism for digital asset transactions. Firstly, the transaction nodes are grouped by type, and each group can handle different types of consensus requests at the same time, which improves the consensus efficiency as well as the accuracy of digital asset transactions. Second, the group develops techniques like validation, auditing, and re-election to enhance Byzantine fault tolerance by thwarting malicious node attacks. This supervisory mechanism is implemented through the Raft consensus algorithm. Finally, the consensus is stratified for the nodes in the group, and the consensus nodes in the upper layer recursively send consensus requests to the lower layer until the consensus request reaches the end layer to ensure the consistency of the block ledger in the group. Based on the results of the experiment, the approach may significantly outperform the PBFT consensus algorithm when it comes to accuracy, efficiency, and preserving the security and reliability of transactions in large-scale network node digital transaction situations.

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.

Optimized byzantine fault tolerant algorithm for improving performance and security with trust values

AbstractBlockchain is considered to be a promising technology due to its decentralization, open, and non tamperation. Nevertheless, the current blockchain system cannot replace traditional financial institutions because its performance and security indicators in the consensus algorithm are not perfect. As one of the emerging capacity expansion technologies, sharding technology improves throughput by grouping users and processing transactions in parallel. This paper proposes an improved Byzantine Fault Tolerance algorithm TV‐BRAFT. TV‐BRAFT calculates a trust value for each user through an incentive mechanism. The sharding scheme based on the trust value is adopted to reduce the probability of malicious nodes being allocated to the same partition, thus improving the security of the system. In the consensus, the system selects users with qualified trust values to form a verification group to supervise the consensus process and avoid submitting error transactions to the blockchain. In order to prove that the TV‐BRAFT can resist Byzantine attacks, a recursive formula is used to prove the security of sharding and the security of consensus within one shard. Finally, the simulation results show that the TV‐BRAFT not only guarantees the fairness of incentives but is also better than the Raft and PBFT algorithms in efficiency and throughput.

A User Authentication Schema Under the Integration of Mobile Edge Computing and Blockchain Technology

The safe and efficient authentication of users is the basis for the realization of the Internet of Things. A reliable and fast user authentication schema that combines mobile edge computing and blockchain technology is proposed. This schema adopts the polling hosting method to optimize the practical Byzantine Fault Tolerance (PBFT) algorithm, it reduces the impact of tokens in the algorithm, and ensures trusted authentication. The two-way authentication protocol between the cluster head and the base station, and the one-way authentication protocol between the base station and the sensor node are designed to effectively simplify the authentication process of sensor nodes, which further guarantees the security and speed of user authentication and effectively meets the security, reliability, and convenience requirements of the Internet of Things. Simulation experiments show that the schema can achieve efficient information verification, and the identity authentication time and protocol authentication times are only 23.58 ms and 25.06 ms, respectively, which has obvious performance advantages over the Paillier algorithm, the hybrid Paillier-blowfish algorithm, and the ElGamal algorithm.

Anti-Counterfeiting and Traceability Consensus Algorithm Based on Weightage to Contributors in a Food Supply Chain of Industry 4.0

Supply chain management can significantly benefit from contemporary technologies. Among these technologies, blockchain is considered suitable for anti-counterfeiting and traceability applications due to its openness, decentralization, anonymity, and other characteristics. This article introduces different types of blockchains and standard algorithms used in blockchain technology and discusses their advantages and disadvantages. To improve the work efficiency of anti-counterfeiting traceability systems in supply chains and reduce their energy consumption, this paper proposes a model based on the practical Byzantine fault tolerance (PBFT) algorithm of alliance chains. This model uses a credit evaluation system to select the primary node and integrates the weightage to contributors (WtC) algorithm based on the consensus mechanism. This model can reduce the decline in the algorithm success rate while increasing the number of malicious transaction nodes, thereby reducing the computing cost. Additionally, the throughput of the algorithmic system increases rapidly, reaching approximately 680 transactions per second (TPS) in about 120 min after the malicious nodes are eliminated. The throughput rapidly increases as the blacklist mechanism reduces the number of malicious nodes, which improves the system’s fault tolerance. To validate the effectiveness of the proposed model, a case study was conducted using data from the anti-counterfeiting traceability system of the real-life supply chain of a food company. The analysis results show that after a period of stable operation of the WtCPBFT algorithm in the proposed model, the overall communication cost of the system was reduced, the throughput and stability were improved, and the fault-tolerant performance of the system was improved. In conclusion, this paper presents a novel model that utilizes the PBFT algorithm of alliance chains and the WtC algorithm to improve the efficiency and security of anti-counterfeiting traceability systems in supply chains. The results of the case study indicate that this model can effectively reduce communication costs, improve throughput and stability, and enhance the fault tolerance of the system.

Blockchain-Based Double-Layer Byzantine Fault Tolerance for Scalability Enhancement for Building Information Modeling Information Exchange

A Practical Byzantine Fault Tolerance (PBFT) is a consensus algorithm deployed in a consortium blockchain that connects a group of related participants. This type of blockchain suits the implementation of the Building Information Modeling (BIM) information exchange with few participants. However, when much more participants are involved in the BIM information exchange, the PBFT algorithm, which inherently requires intensive communications among participating nodes, has limitations in terms of scalability and performance. The proposed solution for a multi-layer BFT hypothesizes that multi-layer BFT reduces communication complexity. However, having more layers will introduce more latency. Therefore, in this paper, Double-Layer Byzantine Fault Tolerance (DLBFT) is proposed to improve the blockchain scalability and performance of BIM information exchange. This study shows a double-layer network structure of nodes that can be built with each node on the first layer, which connects and forms a group with several nodes on the second layer. This network runs the Byzantine Fault Tolerance algorithm to reach a consensus. Instead of having one node send messages to all the nodes in the peer-to-peer network, one node only sends messages to a limited number of nodes on Layer 1 and up to three nodes in each corresponding group in Layer 2 in a hierarchical network. The DLBFT algorithm has been shown to reduce the required number of messages exchanged among nodes by 84% and the time to reach a consensus by 70%, thus improving blockchain scalability. Further research is required if more than one party is involved in multi-BIM projects.

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.

Randomized Testing of Byzantine Fault Tolerant Algorithms

Byzantine fault-tolerant algorithms promise agreement on a correct value, even if a subset of processes can deviate from the algorithm arbitrarily. While these algorithms provide strong guarantees in theory, in practice, protocol bugs and implementation mistakes may still cause them to go wrong. This paper introduces ByzzFuzz, a simple yet effective method for automatically finding errors in implementations of Byzantine fault-tolerant algorithms through randomized testing. ByzzFuzz detects fault-tolerance bugs by injecting randomly generated network and process faults into their executions. To navigate the space of possible process faults, ByzzFuzz introduces small-scope message mutations which mutate the contents of the protocol messages by applying small changes to the original message either in value (e.g., by incrementing the round number) or in time (e.g., by repeating a proposal value from a previous message). We find that small-scope mutations, combined with insights from the testing and fuzzing literature, are effective at uncovering protocol logic and implementation bugs in real-world fault-tolerant systems.We implemented ByzzFuzz and applied it to test the production implementations of two popular blockchain systems, Tendermint and Ripple, and an implementation of the seminal PBFT protocol. ByzzFuzz detected several bugs in the implementation of PBFT, a potential liveness violation in Tendermint, and materialized two theoretically described vulnerabilities in Ripple’s XRP Ledger Consensus Algorithm. Moreover, we discovered a previously unknown fault-tolerance bug in the production implementation of Ripple, which is confirmed by the developers and fixed.

An Improved Spectrum Trading Design Based on Dynamic Credit Aggregate-Signature Blockchain

At present, the number of incoming devices and mobile data traffic has seen explosive growth, and spectrum resources are difficult to meet the increasing demand. The traditional centralized spectrum management model suffers from low spectrum utilization, high maintenance costs, and data security issues. The decentralized and secure nature of blockchain technology is a natural advantage in solving the problems faced by the current spectrum management model. However, when introducing traditional blockchain technology into spectrum management, it faces problems such as high latency and high resource consumption. In this letter, we design a new blockchain-enabled spectrum trading framework consisting of the access layer, distribution layer, and core layer, and then propose a user benefit-maximum spectrum trading matching scheme. To solve the problem of latency and energy consumption of consensus algorithms in blockchains, the dynamic credit aggregate-signature Byzantine fault tolerance (DCABFT) algorithm based on the Boneh-Lynn-Shacham (BLS) aggregated signature is proposed. Simulation results demonstrate that the proposed scheme can greatly improve the transaction latency and users’ quality of service.