Byzantine Fault Tolerance Consensus Research Articles

A Dynamic Adaptive Framework for Practical Byzantine Fault Tolerance Consensus Protocol in the Internet of Things

A Dynamic Adaptive Framework for Practical Byzantine Fault Tolerance Consensus Protocol in the Internet of Things

Improvement of PBFT Consensus Algorithm Based on Affinity Propagation Clustering in Intellectual Property Transaction Scenarios

In response to the problems of random selection of primary nodes, high communication complexity, and low consensus efficiency in the current consensus mechanism for intellectual property transactions, a Practical Byzantine Fault Tolerance (PBFT) consensus algorithm based on the Affinity-Propagation (AP) clustering algorithm, termed AP-PBFT, is proposed. Firstly, the election strategy of the leader node is constructed based on the reputation mechanism; the reward and punishment mechanism is designed to achieve the dynamic adjustment of the reputation value of the nodes in the PBFT consensus process, and the number of votes among the nodes is introduced to determine the node’s reputation value in collaboration with the reward and punishment mechanism to guarantee the precise ordering of the nodes. Secondly, nodes with high reputation values are selected as cluster centers to run the AP clustering algorithm, and clustering groups of knowledge property transaction nodes are constructed based on responsibility and availability. Finally, the three-stage consensus process of the PBFT consensus algorithm is optimized, and the consensus task is decomposed into two layers: the intra-consensus group and the inter-leader node group, reducing the communication complexity of transaction data in the blockchain. Experimental findings indicate a significant performance improvement of the algorithm over the PBFT consensus algorithm in communication complexity, throughput, and consensus efficiency in the simulation environment of multiple types of transactions in intellectual property transactions, including different types of large-scale transaction scenarios, such as purchases, sales, licenses, and transfers.

Exploring Fault Tolerance Consensus for Wireless Sensor Networks: A Comprehensive Detailed Study

The integration of wireless networks into modern communication systems has revolutionized information exchange across various applications. However, achieving reliable agreement in these networks is significantly impeded by their unique properties, such as blurring, interruption, and transparency. A fundamental component of distributed systems, fault-tolerant consensus ensures that nodes in the network can agree on a consistent value even in the presence of malfunctioning or corrupted elements. This study explores both non-Byzantine and Byzantine fault-tolerant consensus approaches, with a focus on achieving agreement in the presence of benign faults. The importance of fault-tolerant consensus in wireless connections is underscored, particularly in applications like wireless blockchain, IoT, and vehicular networks. The research delves into wireless network-specific fault-tolerant consensus algorithms to address the specific challenges posed by networking environments. Furthermore, a comparative analysis of Byzantine Fault Tolerance mechanisms in distributed systems is provided to shed light on their features and benefits. It highlights the importance of ensuring system reliability and consistency in wireless networks to maintain seamless communication and data integrity. Moreover, the paper emphasizes the critical role of fault-tolerant consensus in enhancing system resilience and performance. It underscores the need for robust algorithms and protocols to detect and mitigate errors, ensuring reliable communication and coordination despite potential node failures. By providing insights into fault-tolerant consensus mechanisms tailored to dynamic conditions, the study aims to optimize system adaptation and effectively mitigate both Byzantine and non-Byzantine failures in wireless network environments.

Research on evolutionary game of digital twin data information sharing based on blockchain technology

Due to the significant characteristics of decentralization and tamper resistance of blockchain technology, it helps to solve the problems of timeliness and slow permission control in traditional information sharing. However, most researchers are committed to exploring how to improve the efficiency, reliability, and privacy security of digital twin data. There is a lack of research on issues such as blockchain participants free-riding and not actively participating in information sharing, and how to promote information sharing through incentives. Therefore, this paper designs a distance grouping based practical byzantine fault tolerance consensus algorithm to address the credibility issue of transmitted data, thereby improving the efficiency of negotiation. The feasibility of the algorithm is verified through cases analysis. In addition, for the problem of low subjective willingness of information sharing, this paper designs an information sharing incentive strategy based on blockchain intelligent contracts, establishes digital twin data sharing evolutionary game models with reputation incentives and non-reputation incentives, so as to explore the impact of reputation incentive on evolutionary stability strategies. Finally, simulation analysis is conducted on the evolutionary game model of digital twin data sharing. The impact of several key indicators such as data complementarity, trust, positive incentive coefficient, and data sharing cost on the evolution process of information sharing are considered, and corresponding management insights are obtained.

Improvement of Practical Byzantine Fault Tolerance Consensus Algorithm Based on DIANA in Intellectual Property Environment Transactions

In response to the shortcomings of the consensus algorithm for intellectual property transactions, such as high communication overhead, random primary node selection, and prolonged consensus time, a Practical Byzantine Fault Tolerance (PBFT) improvement algorithm based on Divisive Analysis (DIANA) D-PBFT algorithm is proposed. Firstly, the algorithm adopts the hierarchical clustering mechanism of DIANA to cluster nodes based on similarity, enhancing node partition accuracy and reducing the number of participating consensus nodes. Secondly, it designs a reward and punishment system based on node ranking, to achieve consistency between node status and permissions, timely evaluation, and feedback on node behaviours, thereby enhancing node enthusiasm. Then, the election method of the primary node is improved by constructing proxy and alternate nodes and adopting a majority voting strategy to achieve the selection and reliability of the primary node. Finally, the consistency protocol is optimised to perform consensus once within the cluster and once between all primary nodes, to ensure the accuracy of the consensus results. Experimental results demonstrate that the D-PBFT algorithm shows a better performance, in terms of communication complexity, throughput, and latency.

Double‐layer Byzantine fault‐tolerant grouping consensus algorithm based on raft

AbstractAddressing the scalability issues, excessive communication overhead, and challenges in adapting to large‐scale network node environments faced by the Practical Byzantine Fault Tolerance (PBFT) consensus algorithm currently employed in consortium blockchains, this paper proposes a Double Layer Consensus Algorithm Based on RAFT and PBFT Consensus Algorithms (DLCA_R_P). The nodes in the blockchain are initially divided into several groups to form the lower‐layer consensus network. Subsequently, the leaders of these groups constitute the upper‐layer consensus network, creating a dual‐layer consensus network structure. Within the lower‐layer consensus network, the PBFT consensus algorithm is employed for consensus among the groups, while the primary accountants form the upper‐layer RAFT consensus network. The algorithm incorporates a supervision mechanism and a reputation mechanism to enhance the security of the consensus network. Additionally, a grouping mechanism is introduced to transform the consensus network into a dynamic structure. Experimental results analysis demonstrates that compared to traditional PBFT consensus algorithms, DLCA_R_P reduces consensus latency by two orders of magnitude and improves throughput by one order of magnitude in a scenario with 100 nodes. Furthermore, it exhibits significant advantages over other improved algorithms. Thus, the DLCA_R_P consensus algorithm exhibits excellent scalability and can be widely applied in various scenarios within consortium blockchains.

Scaling Byzantine Fault-Tolerant Consensus With Optimized Shading Scheme

Scaling Byzantine Fault-Tolerant Consensus With Optimized Shading Scheme

E-voting system using cloud-based hybrid blockchain technology

With the invention of Internet-enabled devices, cloud and blockchain-based technologies, an online voting system can smoothly carry out election processes. During pandemic situations, citizens tend to develop panic about mass gatherings, which may influence the decrease in the number of votes. This urges a reliable, flexible, transparent, secure, and cost-effective voting system. The proposed online voting system using cloud-based hybrid blockchain technology eradicates the flaws that persist in the existing voting system, and it is carried out in three phases: the registration phase, vote casting phase and vote counting phase. A timestamp-based authentication protocol with digital signature validates voters and candidates during the registration and vote casting phases. Using smart contracts, third-party interventions are eliminated, and the transactions are secured in the blockchain network. Finally, to provide accurate voting results, the practical Byzantine fault tolerance (PBFT) consensus mechanism is adopted to ensure that the vote has not been modified or corrupted. Hence, the overall performance of the proposed system is significantly better than that of the existing system. Further performance was analyzed based on authentication delay, vote alteration, response time, and latency.

Trapdoor proof of work.

Consensus algorithms play a crucial role in facilitating decision-making among a group of entities. In certain scenarios, some entities may attempt to hinder the consensus process, necessitating the use of Byzantine fault-tolerant consensus algorithms. Conversely, in scenarios where entities trust each other, more efficient crash fault-tolerant consensus algorithms can be employed. This study proposes an efficient consensus algorithm for an intermediate scenario that is both frequent and underexplored, involving a combination of non-trusting entities and a trusted entity. In particular, this study introduces a novel mining algorithm, based on chameleon hash functions, for the Nakamoto consensus. The resulting algorithm enables the trusted entity to generate tens of thousands blocks per second even on devices with low energy consumption, like personal laptops. This algorithm holds promise for use in centralized systems that require temporary decentralization, such as the creation of central bank digital currencies where service availability is of utmost importance.

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.

Practical Byzantine Fault Tolerance-Enhanced Blockchain-Enabled Data Sharing System: Latency and Age of Data Package Analysis

Data timeliness, privacy, and security are key enablers for data-sharing systems to support time-sensitive and mission-critical systems and applications. While blockchain-enabled data sharing frameworks can offer reliable security and privacy when properly implemented, the timeliness of data and the related latency are important issues that can limit the adoption of blockchain in large-scale mission-critical applications. This paper thus carried out a performance analysis of the blockchain-enabled data-sharing framework from latency and data age perspectives to investigate the suitability of blockchain technology in data sharing systems. To achieve this, the uniqueness of such systems such as transactions validation latency, transaction generation rate, waiting time, blockchain-appending rate, and overall communication latency were jointly studied. The communication latency was characterized following the spatiotemporal modeling approach. We further adopted the practical Byzantine fault tolerance (PBFT) consensus protocol due to its well discussed suitability in large-scale data sharing applications and captured the validation stages of such a PBFT scheme using the Erlang distribution of order <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$k$</tex-math></inline-formula> . Simulations results show that various influential system parameters must be carefully considered when adopting blockchain technology in time-sensitive data sharing applications. This will guide the adoption of blockchain technology in various data sharing applications and systems.

An Efficient and Scalable Byzantine Fault-Tolerant Consensus Mechanism Based on Credit Scoring and Aggregated Signatures

An Efficient and Scalable Byzantine Fault-Tolerant Consensus Mechanism Based on Credit Scoring and Aggregated Signatures

CRBFT: A Byzantine Fault-Tolerant Consensus Protocol Based on Collaborative Filtering Recommendation for Blockchains

CRBFT: A Byzantine Fault-Tolerant Consensus Protocol Based on Collaborative Filtering Recommendation for Blockchains

B-UAVM: A Blockchain-Supported Secure Multi-UAV Task Management Scheme

The advent of unmanned aerial vehicle (UAV) swarm technology brings possibilities to help humans complete tasks in no man’s land, such as deserts, and rainforests. However, UAV network faces many cyber threats, where attackers can impersonate legitimate entities or tamper with UAV task data. For identity security, most of the existing methods use centralized authentication schemes, which have a single point of failure problem. For data security, the existing methods only secure the task data in the ground system, ignoring the data security in the air network. Therefore, the existing methods are not suitable for ubiquitous UAV scenarios. Blockchain secures data security while eliminating the single point of failure problem, and has been widely used in distributed scenarios. In this paper, to secure entity identity and task data, we propose a Blockchain-supported Secure Multi UAV Task Management Scheme (B-UAVM). Specifically, a three-layer blockchain structure is constructed to secure multi-tasks, and achieve ubiquitous control of UAV formations. Besides, six types of blocks and three types of transactions are designed to achieve safe processing and storage of task data and entity information. Furthermore, an improved Practical Byzantine Fault Tolerance (IPBFT) consensus mechanism and a UAV-formation-action-considered ground station consensus mechanism (UFAGS) are introduced in the Server Network and Ground Control Network, respectively, to accelerate the consensus. The experimental results show that the number of transactions generated per second (TPS) of B-UAVM is about 0.5× and 3.7× of the existing method when the block size or the number of blockchain nodes increases, respectively.

An improved PBFT consensus mechanism with trust value evaluation application in the agricultural product trusted traceability system

Blockchain has the advantages of tamper proof, high reliability and traceability, so it can better support the agricultural product traceability system. However, the agricultural product supply chain has the characteristics of long chain and decentralized production, which makes the application of the combination of blockchain technology and agricultural product traceability have many nodes, large system overhead and other problems. In order to solve the above problems, this paper proposes a Practical Byzantine Fault Tolerance (PBFT) consensus mechanism based on trust value evaluation, and uses this optimization algorithm to propose an architecture model to meet the demand for trusted traceability of agricultural product supply chain, so as to realize the distributed storage and security protection of supply chain data. In order to ensure the effective operation of the blockchain system, this paper studies the consensus mechanism in the blockchain network, designs a trust value evaluation model to calculate the trust value of nodes, and selects trusted nodes to join the consensus group based on the trust value, which ensures the credibility of the consensus nodes. At the same time, the consistency protocol is optimized to reduce the communication overhead in the consensus process. The experimental results show that the consensus mechanism improved in this paper has certain advantages in communication overhead, transaction delay and throughput. Compared with the existing storage model, the model described in this paper has higher security and throughput efficiency, effectively ensures the reliable traceability of data, and can be better applied to the traceability scenario of agricultural product supply chain.

A Cross-Institution Information-Sharing Scheme Based on a Consortium Blockchain

In today’s data-driven world, efficient and secure cross-institution information-sharing is an urgent challenge. Traditional information-sharing methods based on access controlling often suffer from issues such as privacy breaches and high communication complexity. To address this issue, this paper proposes a cross-institution information-sharing solution based on a consortium blockchain, in which it combines on-chain transaction consensus with off-chain institution storage, thereby facilitating collaboration among nodes from different institutions on the blockchain. To enhance the efficiency and security of transactions on the blockchain, we also introduce a dynamic and adaptive Practical Byzantine Fault Tolerance (DA-PBFT) consensus protocol, which permits nodes to dynamically join and exit the blockchain network, consequently improving network scalability. Through a reputation mechanism, we swiftly identify and remove faulty and malicious nodes, enhancing the trustworthiness of nodes in the information-sharing network based on consortium blockchain, thereby improving consensus efficiency. We have also employed encryption techniques to enhance the privacy and integrity of data during the process of cross-institution information sharing. A comprehensive analysis of the communication complexity in the information-sharing network confirms the effectiveness and security of our proposed solution. We offer a unique solution to improve the efficiency and security of cross-institution information-sharing while ensuring data integrity and privacy. By addressing the challenges of privacy breaches and high communication complexity in information sharing, we establish a foundation for secure cross-institution data exchange.

An Efficient and Secure Blockchain Consensus Protocol for Internet of Vehicles

Conventional blockchain consensus protocols tailored for the Internet of Vehicles (IoV) usually face low transaction throughput, high latency, and elevated communication overhead issues. To address these issues, in this paper, we propose ESBCP, an efficient and secure blockchain consensus protocol for the IoV environment. Firstly, considering the significant performance differences among nodes in the IoV, we designed a blockchain consensus model for the IoV. Roadside units execute a trust evaluation mechanism to select high-quality vehicle nodes for the consensus process, thereby reducing the likelihood of malicious nodes in the consensus cluster. Secondly, we designed a node partition strategy to adapt to the dynamic feature of the IoV. Finally, addressing the mobility of nodes in the IoV, we introduced a dynamic unique node list. Vehicle nodes can promptly select nodes with high reliability from the list of communicable nodes to join their unique node list, while also promptly removing nodes with low reliability from their unique node list. Combining these strategies, we propose DK-PBFT, an improved Practical Byzantine Fault Tolerance consensus algorithm. The algorithm meets the efficiency and mobility requirements of vehicular networks. Through theoretical analysis, ESBCP could prevent external and internal security risks while reducing communication overhead. Experimental verification demonstrated that ESBCP effectively reduces consensus latency and improves transaction throughput. Our proposed ESBCP can be used in other application scenarios that require high consensus efficiency.

Performance Evaluation of QUIC Protocol in Message Replication Overhead in PBFT Consensus using NS-3

The development of protocols in the ICT world to increase reliability and speed in data traffic gave an inspiration to a new protocol called the QUIC protocol. The QUIC protocol is expected to improve the performance of Transport Control Protocol (TCP). In addition, developments also occur in blockchain technology where the protocol used in this technology still uses the existing TCP protocol. In this paper, we aimed to research whether the QUIC protocol implementation in blockchain infrastructure could improve the performance of the blockchain infrastructure itself, in terms of the time required for transactions. We focus on conducting research to measure the overhead time reduction of Practical Byzantine Fault Tolerance (PBFT) consensus by implementing the QUIC protocol, the consensus propagation process is a crucial phase in Blockchain. For simulation we used NS-3 discrete simulation environment to conduct scenario and our simulation result showed that the QUIC Protocol have potential significant performance compared to TCP Protocol in large datasets, on the other hand QUIC protocols have more room for improvement by implementing appropriate congestion algorithms.

Analytical model for performability evaluation of Practical Byzantine Fault-Tolerant systems

Designing systems tolerant to faults is crucial to assure continuity of service for mission critical applications. However, their implementation may be costly and challenging. In this study, analytical models are presented for performance evaluation of systems equipped with Practical Byzantine Fault-Tolerant consensus protocols. Byzantine Fault Tolerance is particularly compelling, since it can provide a robust consensus mechanism to implement decentralized platforms, like Decentralized Ledger Technology and, notably, blockchains. The performability model is based on continuous-time Markov chains, in which the processes involved follow the exponential distribution. The numerical results presented report an inverse non-linear relation between number of nodes and performability. Performance decreases also as the ratio between break-down rate and repair rate increases.

BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning

BW-PBFT: Practical byzantine fault tolerance consensus algorithm based on credit bidirectionally waning