Practical Byzantine Fault Tolerance Algorithm Research Articles

A Prototype Model of Zero Trust Architecture Blockchain with EigenTrust-Based Practical Byzantine Fault Tolerance Protocol to Manage Decentralized Clinical Trials

The COVID-19 pandemic necessitated the emergence of decentralized Clinical Trials (DCTs) due to patient retention, accelerate trials, improve data accessibility, enable virtual care, and facilitate seamless communication through integrated systems. However, integrating systems in DCTs exposes clinical data to potential security threats, making them susceptible to theft at any stage, a high risk of protocol deviations, and monitoring issues. To mitigate these challenges, blockchain technology serves as a secure framework, acting as a decentralized ledger, creating an immutable environment by establishing a zero-trust architecture, where data are deemed untrusted until verified. In combination with Internet of Things (IoT)-enabled wearable devices, blockchain secures the transfer of clinical trial data on private blockchains during DCT automation and operations. This paper proposes a prototype model of the Zero-Trust Architecture Blockchain (z-TAB) to integrate patient-generated clinical trial data during DCT operation management. The EigenTrust-based Practical Byzantine Fault Tolerance (T-PBFT) algorithm has been incorporated as a consensus protocol, leveraging Hyperledger Fabric. Furthermore, the Internet of Things (IoT) has been integrated to streamline data processing among stakeholders within the blockchain platforms. Rigorous evaluation has been done for immutability, privacy and security, mutual consensus, transparency, accountability, tracking and tracing, and temperature‒humidity control parameters.

DTPBFT:A dynamic and highly trusted blockchain consensus algorithm for UAV swarm

With the continuous development of UAV technology, the application of UAV swarm in the military field is gradually becoming the focus of research around the world. Although it can bring a series of benefits in autonomous cooperation, the traditional UAV management technology is prone to hacker attacks due to many security issues such as a single point of failure brought by centralized management. Because of the advantages of distributed, tamper-proof, and traceability, blockchain is applied to UAV swarm to solve some of the security problems caused by centralized management. However, due to the limitations of its consensus algorithm Practical Byzantine Fault Tolerance (PBFT), its communication complexity will increase rapidly with the increase of the number of nodes, which also leads to the poor scalability of the algorithm and can only be applied to small-scale networks. To use the PBFT algorithm in large-scale networks such as UAV swarm, a dynamic and highly trusted PBFT (DTPBFT) algorithm is proposed in this paper. Firstly, a new consensus algorithm model including consensus layer and verification layer is designed. Then, a consensus node election scheme based on trust mechanism is proposed under this model. The trust degree of nodes in the blockchain network is comprehensively evaluated by selecting several representative indicators, and the weight factor of each indicator is calculated by entropy weight method. It not only reduces the communication complexity, but also ensures the reliability and dynamic update of consensus nodes. Experiments show that when the number of UAVs is 200, the consensus time of DTPBFT is 0.24 s, which indicates that this algorithm can support large-scale UAV swarm without causing communication congestion, so it has good scalability. In addition, experiments also show that DTPBFT can tolerate more than 13 malicious nodes, which improves the fault tolerance rate of PBFT.

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.

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.

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.

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.

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.

Blockchain‐based reliable image copyright protection

AbstractThe indiscriminate distribution of a large number of unlicensed images through the Internet seriously harms the benefits of image owners, which prompts the study of image copyright protection solutions. Existing blockchain‐free solutions are limited to using centralized servers to store copyright information, leaving data vulnerable to being lost or tampered with by external attacks. Although the blockchain‐based image copyright protection solutions are capable of addressing the above problem, improvements are needed in choosing a suitable blockchain platform and supporting integrated copyright life cycle management. To this end, this paper designs a blockchain‐based reliable image copyright protection system named BB‐RICP using Hyperledger Fabric. For one thing, the adoption of Fabric mitigates the limitations of other blockchain platforms represented by Ethereum in terms of efficiency, economy, and availability. For another, BB‐RICP successes in achieving integrated copyright lifecycle management. In addition, BB‐RICP achieves enhanced applicability performance by firstly introducing GM algorithms recommended by Chinese national standard and adapting the more consortium blockchain‐oriented practical byzantine fault tolerance algorithm. Moreover, the adoption of spread spectrum watermarking brings convenience to users. Finally, Kubernetes is used to assist in the simulation of BB‐RICP to verify that users can operate reliably in the blockchain network.

EBMICQL: Improving Efficiency of Blockchain Miner Pools via Incremental and Continuous Q-Learning Framework

Blockchain mining pools assist in reducing computational load on individual miner nodes via distributing mining tasks. This distribution must be done in a non-redundant manner, so that each miner is able to calculate block hashes with optimum efficiency. To perform this task, a wide variety of mining optimization methods are proposed by researchers, and most of them distribute mining tasks via statistical request processing models. These models segregate mining requests into non-redundant sets, each of which will be processed by individual miners. But this division of requests follows a static procedure, and does not consider miner specific parameters for set creation, due to which overall efficiency of the underlying model is limited, which reduces its mining performance under real-time scenarios. To overcome this issue, an Incremental & Continuous Q-Learning Framework for generation of miner-specific task groups is proposed in this text. The model initially uses a Genetic Algorithm (GA) method to improve individual miner performance, and then applies Q-Learning to individual mining requests. The Reason for selecting GA model is that it assists in maintaining better speed-to-power (S2P) ratio by optimization of miner resources that are utilized during computations. While, the reason for selecting Q-Learning Model is that it is able to continuously identify miners performance, and create performance-based mining pools at a per-miner level. Due to application of Q-Learning, the model is able to assign capability specific mining tasks to individual miner nodes. Because of this capability-driven approach, the model is able to maximize efficiency of mining, while maintaining its QoS performance. The model was tested on different consensus methods including Practical Byzantine Fault Tolerance Algorithm (PBFT), Proof-of-Work (PoW), Proof-of-Stake (PoS), and Delegated PoS (DPoS), and its performance was evaluated in terms of mining delay, miner efficiency, number of redundant calculations per miner, and energy efficiency for mining nodes. It was observed that the proposed GA based Q-Learning Model was able to reduce mining delay by 4.9%, improve miners efficiency by 7.4%, reduce number of redundant computations by 3.5%, and reduce energy required for mining by 7.1% when compared with various state-of-the-art mining optimization techniques. Similar performance improvement was observed when the model was applied on different blockchain deployments, thus indicating better scalability and deployment capability for multiple application scenarios.

Blockchain-Based Decentralized Federated Learning Method in Edge Computing Environment

In recent years, federated learning has been able to provide an effective solution for data privacy protection, so it has been widely used in financial, medical, and other fields. However, traditional federated learning still suffers from single-point server failure, which is a frequent issue from the centralized server for global model aggregation. Additionally, it also lacks an incentive mechanism, which leads to the insufficient contribution of local devices to global model training. In this paper, we propose a blockchain-based decentralized federated learning method, named BD-FL, to solve these problems. BD-FL combines blockchain and edge computing techniques to build a decentralized federated learning system. An incentive mechanism is introduced to motivate local devices to actively participate in federated learning model training. In order to minimize the cost of model training, BD-FL designs a preference-based stable matching algorithm to bind local devices with appropriate edge servers, which can reduce communication overhead. In addition, we propose a reputation-based practical Byzantine fault tolerance (R-PBFT) algorithm to optimize the consensus process of global model training in the blockchain. Experiment results show that BD-FL effectively reduces the model training time by up to 34.9% compared with several baseline federated learning methods. The R-PBFT algorithm can improve the training efficiency of BD-FL by 12.2%.

An efficient sharding consensus algorithm for consortium chains

The consensus algorithm is very critical in any blockchain system, because it directly affects the performance and security of the blockchain system. At present, the classic Practical Byzantine Fault Tolerance Algorithm (PBFT), which is mainly used in the consortium chain, will lead to system communication congestion and reduced throughput when the number of nodes increases, so the PBFT algorithm is not suitable for large-scale consortium chains. In response to the above problems, this paper proposes a new clustering-based sharding consensus algorithm (KBFT), which aims to ensure that the consortium chain takes into account decentralization, security and scalability. The KBFT algorithm first uses the K-prototype clustering algorithm to shard the nodes in the network according to mixed attributes, and second, disjoint transactions are used to reach consensus in parallel in different shards. Concurrently, the KBFT algorithm introduces a supervision mechanism and a node credit mechanism, which is used to supervise and score the behavior of the nodes and select the proxy nodes, which improves security. We discuss the choice of shard size with the help of the binomial probability distribution and analyze the probability that the system can successfully form a global block under different node failure probabilities. Finally, the proposed algorithm is evaluated through theoretical analysis and simulation experiments. Results show that the proposed algorithm achieves a marked improvement in scalability and throughput along with a marked reduction in communication complexity compared with the classic baseline algorithm PBFT in this field of study, which improves the operating efficiency of the system and simultaneously guarantees the security and robustness of the system.

A Scalable Byzantine Fault Tolerance Algorithm Based on a Tree Topology Network

The consortium chain is the main form of application of blockchain technology in the actual industry, and its consensus mechanism mostly adopts the practical Byzantine fault tolerance (PBFT) algorithm. The traditional PBFT algorithm is only suitable for small-scale local area networks, but in large-scale wide-area network environments, its scalability bottleneck has a serious impact on the performance of the system. Therefore, in this paper, a scalable Byzantine fault tolerance algorithm based on a tree topology network is proposed (STBFT), which can take different steps to reach consensus according to the abnormal situation of the system. First, the STBFT algorithm divides the consensus nodes into different layers and groups based on the tree topology network structure, which transforms from global consensus to local consensus and drastically reduces communication consumption. Then, the division method of the group is based on a verifiable random function (VRF), with the purpose of preventing targeted attacks and colluding Byzantine nodes from affecting the normal consensus of the system. Finally, a feedback mechanism is proposed for the first time to reduce the influence of Byzantine failure on hierarchical network systems. The simulation results show that the proposed algorithm reduces the communication complexity and improves the fault tolerance of the system, and the scalability of the tree topology network structure can be better applied in large-scale scenarios such as IoT and health care.

PBFT optimization algorithm based on community contributions.

Community governance is the basic unit of social governance, and it is also an important direction for building a social governance pattern of co-construction, co-governance and sharing. Previous studies have solved the problems of data security, information traceability and participant enthusiasm in the process of community digital governance by building a community governance system based on blockchain technology and incentive mechanisms. The application of blockchain technology can solve the problems of low data security, difficulty in sharing and tracing and low enthusiasm on the part of multiple subjects regarding participation in community governance. The process of community governance involves the cooperation of multiple government departments and multiple social subjects. Under the blockchain architecture, the number of alliance chain nodes will reach 1000 with the expansion of community governance. The existing consensus algorithms for coalition chains are difficult to meet the high concurrent processing requirements under such large-scale nodes. An optimization algorithm has improved the consensus performance to a certain extent, but the existing systems still cannot meet the data needs of the community and are not suitable for community governance scenarios. Since the community governance process only involves the participation of relevant departments in users, all nodes in the network are not required to participate in the consensus under the blockchain architecture. Therefore, a practical Byzantine fault tolerance (PBFT) optimization algorithm based on community contribution (CSPBFT) is proposed here. First, consensus nodes are set according to different roles of participants in community activities, and participants are given different consensus permissions. Second, the consensus process is divided into different stages, and the amount of data processed by each consensus step is reduced. Finally, a two-level consensus network is designed to perform different consensus tasks, and reduce unnecessary communication between nodes to reduce the communication complexity of consensus among nodes. Compared with the PBFT algorithm, CSPBFT reduces the communication complexity from O(N2) to O(N2/C3). Finally, the simulation results show that, through rights management, network level setting and consensus phase division, when the number of nodes in the CSPBFT network is 100-400, the consensus throughput can reach 2000 TPS. When the node in the network is 1000, the instantaneous concurrency is guaranteed to be above 1000 TPS, which can meet the concurrent needs of the community governance scenario.

Privacy-Preserving Data Aggregation Scheme Based on Federated Learning for IIoT

The extensive application of the Internet of Things in the industrial field has formed the industrial Internet of Things (IIoT). By analyzing and training data from the industrial Internet of Things, intelligent manufacturing can be realized. Due to privacy concerns, the industrial data of various institutions cannot be shared, which forms data islands. To address this challenge, we propose a privacy-preserving data aggregation federated learning (PPDAFL) scheme for the IIoT. In federated learning, data aggregation is adopted to protect model changes and provide data security for industrial devices. By utilizing a practical Byzantine fault tolerance (PBFT) algorithm, each round selects an IIoT device from each aggregation area as the data aggregation and initialization node, and uses data aggregation to protect the model changes of a single user while resisting reverse analysis attacks from the industrial management center. The Paillier cryptosystem and secret sharing are combined to realize data security, fault tolerance, and data sharing. A security analysis and performance evaluation show that the scheme reduces computation and communication overheads while guaranteeing data privacy, message authenticity, and integrity.

An Intelligent Optimization Control Method for Enterprise Cost Under Blockchain Environment

This paper uses blockchain technology to conduct in-depth research and analysis on enterprise cost optimization control. Based on the analysis of the cost control status in enterprises, the concept of target cost optimization control and specific control ideas are proposed. And the study of optimization control under target cost based on genetic algorithm is carried out in combination with the current three major controls of quality, schedule, and cost. It provides the technical basis for the realization of the target profit of the enterprise. The Optimized Scalable Byzantine Fault Tolerance (OSBFT) algorithm, which is suitable for spectrum sharing, is proposed based on PBFT (Practical Byzantine Fault Tolerance) algorithm. So, in this paper, an improved consensus algorithm OSBFT (Optimized Scalable Byzantine Fault Tolerance) is proposed based on it. The improved genetic algorithm is used to solve the objective function and verify the validity, reasonableness and applicability of the model and algorithm. It is shown that the introduction of delay cost in the multilevel inventory model reduces the total cost of the optimized model by 16.87% compared to previous studies. The algorithm reduces the consensus steps, incorporates a data synchronization mechanism, and enables nodes to join and exit consensus.