Byzantine Fault Tolerance Algorithm Research Articles

Research on Digital Identity Authentication Technology Based On Block Chain

In the traditional digital identity authentication, there are potential security threats caused by the user’s personal privacy data being too centralized and vulnerable to attack, and data centralization will lead to data redundancy, poor permeability, user’s lack of master control, high overall cost, and potential threats of abuse of central rights. The digital identity authentication technology based on block chain can perfectly solve the problem of appeal. The main innovative work includes the design of a new digital identity ID and a new asynchronous Byzantine fault-tolerant algorithm dsbft using cryptography, computer network, asynchronous Byzantine fault-tolerant algorithm and other technologies, Block chain is designed based on ID and dsbft, and a decentralized identity authentication system is designed based on block chain. Hash algorithm is used for signature and acceptance to improve authentication efficiency and scalability. In order to solve the dust attack and quantum computation, the elliptic curve digital signature algorithm (ECDSA) encryption algorithm can be combined with other cryptography. The results show that the appeal identity authentication scheme can resist a variety of attacks and has high efficiency and security.

Research on Practical Byzantine Fault Tolerant Consensus Algorithm Based on Blockchain

Practical Byzantine Fault-tolerant Algorithm (PBFT) is the most widely used consensus algorithm in alliance chain, which has the advantages of fault tolerance and large throughput. However, PBFT also has some problems that can’t be ignored in specific blockchain applications, such as bad behavior of master node, high network communication overhead and low system flexibility. In this paper, the improvement measures of PBFT consensus algorithm are summarized from many aspects, and then compared with traditional PBFT algorithm. Finally, the development direction and trend of PBFT algorithm are prospected, hoping to provide reference for the research and innovation of PBFT consensus algorithm in the future.

Intrusion Detection Analysis of Internet of Things considering Practical Byzantine Fault Tolerance (PBFT) Algorithm

In order to improve the security performance and accuracy of the Internet of things in the use process, it is necessary to use the Internet of things intrusion detection method. At present, the problem of inconsistency between the accuracy of detection results and nodes is more prominent when the Internet of things intrusion detection methods are running. This paper proposes a practical Byzantine fault‐tolerant intrusion detection method for the use process of the Internet of things. This method introduces the intrusion detection method and the operation function of foreign attackers on the basis of practical Byzantine fault tolerance; using the expected utility function to the corresponding benefit function of practical Byzantine fault tolerance, the results of Internet of things intrusion detection model can be effectively calculated. Finally, the experimental results show that compared with the existing intrusion detection methods, the proposed method can effectively reduce the energy consumption of the Internet of things in the operation process, can effectively reduce 14.3% and 7.8%, and can effectively reduce the energy consumption of the Internet of things in the operation process.

Improve PBFT Based on Hash Ring

Aiming at the problems of practical Byzantine fault tolerance (PBFT) algorithm, such as high communication complexity, frequent switching views because of Byzantine node become primary nodes and random selection of primary node, HR‐PBFT algorithm is proposed. First, the HR‐PBFT algorithm uses a hash ring to group nodes, which ensures the randomness and fairness of the grouping. Then, a dual‐view mechanism is used in the consensus process, where the first layer node maintains the primary view and the second layer node maintains the secondary view to ensure the proper operation of the algorithm. Finally, the Byzantine node determination mechanism is introduced to evaluate the node status according to the node behavior in the consensus process, improve the reliability of primary node selection, and reduce the frequency of view changes. The experimental results show that the optimized HR‐PBFT algorithm can effectively improve the problem of the sharp increase in the number of communications caused by the increase in the number of nodes in the network and prevent frequent view changes.

An Economic Model of Consensus on Distributed Ledgers

In recent years, the designs of many new blockchain applications have been inspired by the Byzantine fault tolerance (BFT) problem. While traditional BFT protocols assume that most system nodes are honest (in that they follow the protocol), we recognize that blockchains are deployed in environments where nodes are subject to strategic incentives. This paper develops an economic framework for analyzing such cases. Specifically, we assume that 1) non-Byzantine nodes are rational, so we explicitly study their incentives when participating in a BFT consensus process; 2) non-Byzantine nodes are ambiguity averse, and specifically, Knightian uncertain about Byzantine actions; and 3) decisions/inferences are all based on local information. The consensus game then resembles one with preplay “cheap talk” communications. We characterize all equilibria, some of which feature rational leaders withholding messages from some nodes in order to achieve consensus. These findings enrich those from traditional BFT algorithms, where an honest leader always sends messages to all nodes. We also study how the progress of communication technology (i.e., potential message losses) affects the equilibrium consensus outcome.

Research on Optimization of Blockchain Network and Data Communication in the Ecological Structure of Sports Industry

Problems such as excessive centralization of sports industry operations, unclear value, and lack of IP protection hinder the benign interaction between various formats of the sports industry and the healthy operation of the industrial ecosystem. This article is aimed at studying the use of the decentralization, openness and transparency, smart contracts, copyright traceability, and other characteristics of the BT to construct a PCMR model, which can solve the pain points faced by the sports industry ecosystem in a targeted manner, and forming a way to reconstruct trust, the specific implementation path of the integration of BT and sports industry with mechanism as the core. This paper proposes blockchain network and data communication algorithms such as consensus algorithm, signature core algorithm, and practical Byzantine fault‐tolerant algorithm to provide technical support for the application of blockchain technology in the sports industry ecosystem and, at the same time, provide technical support for blockchain network and data communication. The feasibility analysis of the application of the sports industry ecosystem is proposed, and the implementation path of the blockchain network and data communication to reconstruct the sports industry ecosystem is analyzed. Finally, the empirical test of the support of blockchain sports to the sports industry is carried out. By analyzing the panel data of 240 observations of 48 listed companies in 5 years as a sample of the sports industry, the experimental results show that the dominant modulus of the sample does not have other differences, and the leftovers all pass significance test at the 10% level at least, denoting that the fundamental sample is more rational.

Improved Byzantine Fault‐Tolerant Algorithm Based on Alliance Chain

Alliance chain is a typical multicenter block chain and is easily implemented, so it is supported by more and more enterprises and governments. This paper analyzes the advantages and disadvantages of the Practical Byzantine Fault Tolerance (PBFT) in the alliance chain application scene. Aiming at the low efficiency of multinode consensus of the PBFT algorithm, the C‐Raft‐PBFT consensus algorithm is proposed. By integrating the Raft algorithm and the PBFT algorithm with the credit mechanism, designing node credit evaluation and grading protocols, and increasing Byzantine node detection based on feedback mechanism and other methods, the system efficiency is improved. The experiment results show that the improved algorithm has better throughput and lower delay, and the system’s fault tolerance is also improved. Among them, the delay is reduced by 1.93 seconds on average; in the case of an increase in system nodes, the number of nodes in the experimental data is between 200 and 225, and the throughput is increased by 6.46% on average.

SSHC: A Secure and Scalable Hybrid Consensus Protocol for Sharding Blockchains With a Formal Security Framework

Sharding blockchains are proposed to solve the scalability problem while maintaining security and decentralization. However, there are still many issues to be solved. First, the member selection and assignment process are not strictly analyzed, which might lead to an increase in the adversary proportion. Second, current intra-shard consensus algorithms are inefficient. Besides, cross-shard transaction processing costs expensive system overhead. Moreover, there is a lack of a formal security framework. In this article, we propose a secure and scalable hybrid consensus (SSHC). First, we propose a fair sharding selection scheme to select committee members, including mining processes and member lists confirmation by a reference committee. Second, a pipelined Byzantine fault tolerance for intra-shard consensus is designed, combining the pipelined technology with threshold signatures. Third, we propose a responsive sharding transaction batch processing mechanism to handle cross-shard transactions, which reduces the number of calls to Byzantine fault tolerance algorithms. Fourth, a secure committee reconfiguration method is designed to update shard members efficiently. Furthermore, we employ a formal security framework to design and analyze a sharding blockchain. For an adversary whose computational power fraction is less than <inline-formula><tex-math notation="LaTeX">$1/3$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:math><inline-graphic xlink:href="liu-ieq1-3047487.gif"/></alternatives></inline-formula>, by reasonably setting a corruption parameter and other related parameters, SSHC is proved to achieve consistency and liveness.

Blockchain-Enhanced High-Confidence Energy Sharing in Internet of Electric Vehicles

To introduce the opportunities brought by plug-in hybrid electric vehicles (PHEVs) to the energy Internet, we propose a local vehicle-to-vehicle (V2V) energy trading architecture based on fog computing in social hotspots and model the social welfare maximization (SWM) problem to balance the interests of both charging and discharging PHEVs. Considering transaction security and privacy protection issues, we employ a consortium blockchain in our designed energy trading architecture, which is different from the traditional centralized power systems, to reduce the reliance on trusted third parties. Moreover, we improve the practical Byzantine fault tolerance (PBFT) algorithm and introduce it into a consensus algorithm, called the delegated proof of stake (DPOS) algorithm, to design a more efficient and promising consensus algorithm, called DPOSP, which greatly reduces resource consumption and enhances consensus efficiency. To encourage PHEVs to participate in V2V energy transactions, we design an energy iterative bidirectional auction (EIDA) mechanism to resolve the SWM problem and obtain optimal charging and discharging decisions and energy pricing. Finally, we conduct extensive simulations to verify the proposed DPOSP algorithm and provide numerical results for a comparison with the performance of the genetic algorithm and the Lagrange algorithm in achieving EIDA.

Distributed Error Correction Coding Scheme for Low Storage Blockchain Systems

This article presents a novel way to reduce blockchain nodes’ memory requirements using error correcting codes. In particular, LDPC codes are taken as examples to explicitly demonstrate the scheme. The proposed coding scheme encodes data across multiple blocks, respectively, block headers, in the blockchain. This leads to a significant reduction in required memory at each node. We then apply the proposed coding technique to blockchains organized in two different ways. Our first scheme has the same protocol for mining, broadcasting, and verification of blocks, as Bitcoin-type blockchains. Our scheme is different in that full nodes do not have to store all blocks. Instead they will need to store only one block of a group of $t$ blocks. In the second scheme, we consider a new block verification protocol and an account-based model under the assumption that transmission between any two nodes can be established, as well as the broadcast transmission. Our block verification protocol uses the Byzantine fault tolerance algorithm and requires sending a newly mined block to only a small number of verification nodes, instead of broadcasting it to the entire network, which leads to a reduction of the network load.

Reputation Based Fault Tolerance in Blockchain Networks

The Blockchain technology brings a rapid growth in the industry, It emphasizes the service to lead the complexity of software and malicious attack in the network. This technology is used to monitor the highly vulnerable services and it is used to increase the complexity of the warehouse data. It assures the security and consistency of data, The warehouse data has been replicated the availability and the enhancement of security in the services. This technology originated from internet sector as a decentralized, distributed ledger for data transaction. Nowadays, it is visualised as a backbone or frame work for decentralized data processing in open source network. Blockchain uses variety of consensus protocol which is reliable for nodes and communication resources that is used for data consistency. Byzantine fault tolerance algorithm has been proposed for computational cost and security also for consensus efficiency. This paper deals by proposing practical byzantine fault tolerance on edge computing networks paves away for reducing storage overhead also security purpose on edge devices. The proposed model is simulated in the constrain environment and the results are discussed. It shows that the proposed method has increase the availability and security of the stored data.

Hybrid Consensus Algorithm Optimization: A Mathematical Method Based on POS and PBFT and Its Application in Blockchain

Blockchain is a new technology for processing complex and disordered information with respect to business and other industrial applications. This work is aimed at studying the consensus algorithm of blockchain to improve the performance of blockchain. Despite their advantages, the proof of stake (POS) algorithm and the practical Byzantine fault tolerance (PBFT) algorithm have high latency, low throughput, and poor scalability. In this paper, a blockchain hybrid consensus algorithm which combines advantages of the POS and PBFT algorithms is proposed, and the algorithm is divided into two stages: sortition and witness. The proposed algorithm reduces the number of consensus nodes to a constant value by verifiable pseudorandom sortition and performs transaction witness between nodes. The algorithm is improved and optimized from three dimensions: throughput, latency, and scalability. The experimental results show that the improved hybrid consensus algorithm is significantly superior to the previous single algorithms for its excellent scalability, high throughput, and low latency.

Dynamic reputation–based consensus mechanism: Real-time transactions for energy blockchain

The energy blockchain is a distributed Internet protocol for energy transactions between nodes in power systems. The consensus algorithm is the core component of the energy blockchain and has an essential impact on its application. At present, in the implementation of the energy blockchain, there are problems such as low transaction throughput (transactions per second) and high latency, which cannot meet the application requirements of real-time processing transactions in the energy field. To this end, according to the analysis of conventional blockchain consensus algorithm and traditional practical Byzantine fault tolerance algorithm, a dynamic-reputation practical Byzantine fault tolerance algorithm for the energy blockchain is proposed. The dynamic-reputation practical Byzantine fault tolerance algorithm adopts a credit-based consortium node consensus election method. The monitoring node divides the remaining nodes into two types of nodes according to the reputation value: the consensus node and the secondary node, which, respectively, participate in different stages of the block generation process, and dynamically update the consensus nodes with low reputation ratings. By constructing the experimental platform simulation, the test results verify the effectiveness of the dynamic-reputation practical Byzantine fault tolerance algorithm. Compared with the algorithm of the fabric platform, the dynamic-reputation practical Byzantine fault tolerance algorithm improves the transaction processing speed and is suitable for the blockchain application in the energy field.

Usage of Deep Learning and Blockchain in Compilation and Copyright Protection of Digital Music

In order to explore the application of deep learning algorithms in arrangement and composition, and the role of blockchain in the protection of digital music copyright, a monophonic melody composition model based on the deep generative adversarial networks (DCGANs) is constructed firstly, and the composition performance of the model is analyzed using hymn as input sample in this study. Later, the multi-instrument co-arrangement (MICA) model based on the multi-task learning is proposed, and the composition performance is analyzed by taking the actual music as an input sample. Finally, the improved practical byzantine fault tolerance (IPBFT) algorithm is proposed, and a digital music copyright protection system is designed based on the blockchain in this study. The results indicate that the accuracies constructed DCGANs model in predicting the Soprano and Alto voice melody are higher than those of the DeepBatch model by 2.29% and 3.32%, respectively. The performance on the harmony score, note accuracy, Levenshtein similarity (LS), notes distribution mean square error, and empty as well as the convergence speed of the constructed MICA model are better than those of other models. The average transaction per second (TPS) value of the proposed IPBFT algorithm in the real digital music copyright protection system is 3469, which is superior to other blockchain technologies. Finally, the digital music copyright protection system is achieved, the error rate of completing the request is 0% in the state of many users operating concurrently, and a high TPS value can be guaranteed. In short, the DCGANs and MICA models pointed out in this study can be used in the composition of monophonic melodies and complex melodies, and the digital music copyright protection system based on the blockchain has excellent performance in practical applications.

An Improved Blockchain Consensus Mechanism Based on Open Business Environment

With the rise of the blockchain, the underlying technology has also received more and more attention. The blockchain is a point-to-point distributed system, and the consensus algorithm is a mechanism to resolve the consensus of each node. Byzantine Fault Tolerance (BFT) is a fault-tolerant technology in the field of distributed computing. The blockchain network environment conforms to the Byzantine general problem model. In order to make it suitable for open business environment, we propose an improved blockchain consensus mechanism based on Practical Byzantine Fault Tolerance Algorithm (PBFT) that consider different business. The consensus algorithm proposed in this paper (OBE-PBFT) introduces the historical behavior credit rating of nodes to optimize the view change protocol in PBFT, so as to solve the problem of low consensus success rate and large traffic when encountering Byzantine nodes. The historical credit rating of the node can make the consensus process more robust, in order to solve the problem of different business in the alliance chain consensus mechanism in the open business environment.

Creating a Novel Consensus Algorithm for Distributed Computing use Cases

There are many consensus algorithms that exist in parallel computing that involve multiple computing units like virtual machines which make use of available resources and arrive at a single agreeable state for the combined system. This is done on the basis of voting which itself branches into several arrangements like voting, functions of central tendencies, weighted functions of central tendencies etc. Some applications that consensus algorithms try to cover are: deciding on transaction operations (read, write, commit); deciding on node leaders of a system; maintaining replicas in the state of a machine (also called a state machine) and creating consistency between them. Some common algorithms of this type are Proof of Work algorithm (PoW), the practical Byzantine fault tolerance algorithm (PBFT), the proof-of-stake algorithm (PoS) and the delegated proof-of-stake algorithm (DPoS), Paxos algorithm and the Raft consensus algorithm.

Blockchain based consensus checking in decentralized cloud storage

As a popular application of cloud computing, cloud storage has been widely used. In distributed computing system, blockchain as a secure mechanism is often used to store data, such as account information, trading record, and others. Once any data is saved in blockchain, it is sealed and cannot be changed any more. All the data copies must be consistent in blockchain. In cloud computing, data is always duplicated to prevent the data loss. However, the consensus issue of different data copies may appear in various data operations. Sometimes the results of data operations may be seriously affected. As a useful technique, blockchain can effectively maintain the data consistency in a distributed computing system, including the cloud-based applications, such as cloud storage. Based on a specific type of blockchain called practical Byzantine fault tolerance (PBFT), this paper proposes a synchronous Byzantine fault tolerance (SBFT) algorithm that not only maintains the data consistency, but also has much higher efficiency than other general blockchain algorithms. In a small cloud environment, SBFT is simulated to compare with both Byzantine fault tolerance (BFT) and PBFT. The experiment results demonstrate the better performance of SBFT in data consistency, efficiency, and reliability.

Distributed Key Management for IT Infrastructure using Block Chain and Hash Graph

The Cloud Computing Paradigm simplified the IT infrastructure management thereby making the organiza-tions and enterprises to rapidly migrate from conventional model to service driven model. The service driven model allows the users to access, maintain and backup the files from remote location over the internet through the central-ized cloud service providers. Inspite of major advantages, there are some concerns for the safety and privacy risks of organizational and users sensitive information in cloud stor-age. The existing service oriented model uses distributed key management which encrypts the data and stores it in cloud servers to provide the authentication to data, but it addresses challenges in identifying ownership of data, boot-strapping problem and securing the keys. The proposed system uses block chain, a distributed ledger for user authentication in cloud server and Hash graph with asynchronous byzantine fault tolerance algorithm is proposed for replicat-ed state machines with guaranteed Byzantine fault-tolerance and it can be utilized in the IT Infrastructure envi-ronment which solves the hassles of maintaining security keys

DeepCoin: A Novel Deep Learning and Blockchain-Based Energy Exchange Framework for Smart Grids

In this paper, we propose a novel deep learning and blockchain-based energy framework for smart grids, entitled DeepCoin. The DeepCoin framework uses two schemes, a blockchain-based scheme and a deep learning-based scheme. The blockchain-based scheme consists of five phases: setup phase, agreement phase, creating a block phase and consensus-making phase, and view change phase. It incorporates a novel reliable peer-to-peer energy system that is based on the practical Byzantine fault tolerance algorithm and it achieves high throughput. In order to prevent smart grid attacks, the proposed framework makes the generation of blocks using short signatures and hash functions. The proposed deep learning-based scheme is an intrusion detection system (IDS), which employs recurrent neural networks for detecting network attacks and fraudulent transactions in the blockchain-based energy network. We study the performance of the proposed IDS on three different sources the CICIDS2017 dataset, a power system dataset, and a web robot (Bot)-Internet of Things (IoT) dataset.

Consortium Blockchain-Based Secure Software Defined Vehicular Network

The vehicular ad hoc network (VANET) is a promising technology that can provide Internet access services for vehicles. With the development of VANET, tremendous intelligent vehicles will emerge mass and different communication requirements. Software-defined networking (SDN) is regarded as a potential technology to enhance network performance. In recent years, a new networking paradigm called software defined vehicular networks (SDVN) has been proposed. Nevertheless, the security issues still need to be considered for SDVN, because malicious vehicles can put forward fake requirements on the control plane of SDVN, which deteriorates the network performance in a certain degree. In this paper, we associate resources allocation problem with trust value of vehicles for the first time. The trust value of vehicles can be obtained through trust management system. Considering that there are many defects in the state-in-art trust management schemes, in this paper, a decentralized trust management architecture is designed which constitutes of three layers based on consortium blockchain. A joint proof-of-stake and modified practical Byzantine fault tolerance (PoS-mPBFT) algorithm is proposed to the shorten the confirmation time, which is deployed on RSUs. Different from previous researches that focus on designing methods to evaluate trust value, we use prediction model to estimate trust value of vehicles in the next period. After calculating trust value of vehicles, it assigns more resources to those high credibility vehicles when SDN services are provided. Meanwhile, to increase the efficiency of resource allocation, we convert the multiple-path mapping problem of the virtual network into the multi-commodity flow problem, which is solved by a heuristic algorithm. The simulation results indicate that the proposed trust management architecture and heuristic algorithm could provide better safety in SDVN and shorten consensus time, meanwhile effectively abstract underlying resources to enhance network load balance and capacity.