Yang Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yang Zhang has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Meng Han
Zhejiang University
3 shared publications - Yourong Chen
Zhejiang Shuren University
3 shared publications - Changchun Yang
Changzhou University
2 shared publications - Kelei Miao
College of Information Science and Technology Zhejiang Shuren University Hangzhou China
2 shared publications - Tiaojuan Ren
College of Information Science and Technology, Zhejiang Shuren University, Hangzhou, China
2 shared publications - Xin Xu
College of Communication Engineering, Hangzhou Dianzi University, Hangzhou, Zhejiang, China
2 shared publications
Latest Publications
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Transportation Electrification
- Vol. 12 (2) , 3999-4010
Task Offloading in Hierarchical UAV-Enabled MEC Network: A Trust Region Policy Optimization-Based Approach
With the explosion of multimedia applications and heterogeneous Internet of Things (IoT) devices in service under 5G, the flying ad hoc network (FANET), which acts as an edge server, is overwhelmed by traffic overload. Existing FANET architectures are incomplete for large-scale scenarios, and it is a challenge to optimize uncrewed aerial vehicles (UAVs) offloading decisions and coordinate within the network. In this article, we propose a novel three-layer computational framework for UAVs, which specifies the functions and roles of UAVs in the system. To analyze model performance quantitatively, the interactions of units and tasks are formulated as Markov decision processes (MDPs). Then, we consider delay, energy, and resource allocation to minimize the total system cost. To solve the problem, a multiagent TRPO-based hierarchical computation and offloading (MATRPO-HCO) scheme is proposed to determine the optimal offloading decision for large-scale networks. Simulation results show that the proposed framework is superior to alternative schemes with respect to quality of service (QoS) and fairness.
- 28 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Transportation Electrification
- Vol. 12 (2) , 3999-4010
Task Offloading in Hierarchical UAV-Enabled MEC Network: A Trust Region Policy Optimization-Based Approach
With the explosion of multimedia applications and heterogeneous Internet of Things (IoT) devices in service under 5G, the flying ad hoc network (FANET), which acts as an edge server, is overwhelmed by traffic overload. Existing FANET architectures are incomplete for large-scale scenarios, and it is a challenge to optimize uncrewed aerial vehicles (UAVs) offloading decisions and coordinate within the network. In this article, we propose a novel three-layer computational framework for UAVs, which specifies the functions and roles of UAVs in the system. To analyze model performance quantitatively, the interactions of units and tasks are formulated as Markov decision processes (MDPs). Then, we consider delay, energy, and resource allocation to minimize the total system cost. To solve the problem, a multiagent TRPO-based hierarchical computation and offloading (MATRPO-HCO) scheme is proposed to determine the optimal offloading decision for large-scale networks. Simulation results show that the proposed framework is superior to alternative schemes with respect to quality of service (QoS) and fairness.
- Open Access
- 23 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 172-183
An Efficient Threshold Multi-party Computation Based on Homomorphic Encryption without CRS
- 23 January 2026
- Published by Association for Computing Machinery (ACM)
- p. 172-183
Open AccessAn Efficient Threshold Multi-party Computation Based on Homomorphic Encryption without CRS
- 11 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (22) , 48277-48290
GTMPC: A Secure Multiparty Computation Scheme for IIoT Data Based on Game Theory
Data sharing in the Industrial Internet of Things (IIoT) can increase productivity and reduce costs, but it is critical to ensure data security while sharing data. Secure multiparty computation (MPC) can address security problems, such as data leakage during computation. However, it still faces the risk of malicious behavior from internal participants and the problem of sharing data decision-making. To address these problems, we propose a Game Theory-based secure MPC scheme for IIoT Data (GTMPC). First, we design a traceable, verifiable and auditable industrial data sharing and computing framework for the IIoT based on blockchain. Then, we propose an MPC protocol that can resist malicious behavior from participants. It obtains the voting results through voting identifiers and multiparty multiplication. More importantly, we establish the revenue optimization models of data sharing between consumers and computing devices. Based on the above models, we model the MPC interaction-sharing process between consumers and computing devices as a Stackelberg game, and use the backward induction method to prove that there is a unique Stackelberg equilibrium in the game. Furthermore, we also propose an MPC-solving algorithm based on the Steepest Descent Method (MPC_SDM), and obtain the optimal industrial data sharing scheme and calculation results according to the constantly updated credit score. Finally, the simulation experiment results show that the MPC_SDM algorithm is efficient and feasible in IIoT, better than the comparison algorithm, and the revenue can be increased by 13.2%.
- 11 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 12 (22) , 48277-48290
GTMPC: A Secure Multiparty Computation Scheme for IIoT Data Based on Game Theory
Data sharing in the Industrial Internet of Things (IIoT) can increase productivity and reduce costs, but it is critical to ensure data security while sharing data. Secure multiparty computation (MPC) can address security problems, such as data leakage during computation. However, it still faces the risk of malicious behavior from internal participants and the problem of sharing data decision-making. To address these problems, we propose a Game Theory-based secure MPC scheme for IIoT Data (GTMPC). First, we design a traceable, verifiable and auditable industrial data sharing and computing framework for the IIoT based on blockchain. Then, we propose an MPC protocol that can resist malicious behavior from participants. It obtains the voting results through voting identifiers and multiparty multiplication. More importantly, we establish the revenue optimization models of data sharing between consumers and computing devices. Based on the above models, we model the MPC interaction-sharing process between consumers and computing devices as a Stackelberg game, and use the backward induction method to prove that there is a unique Stackelberg equilibrium in the game. Furthermore, we also propose an MPC-solving algorithm based on the Steepest Descent Method (MPC_SDM), and obtain the optimal industrial data sharing scheme and calculation results according to the constantly updated credit score. Finally, the simulation experiment results show that the MPC_SDM algorithm is efficient and feasible in IIoT, better than the comparison algorithm, and the revenue can be increased by 13.2%.
- 4 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (4) , 6300-6312
Efficient and Secure Blockchain Consensus Algorithm for Heterogeneous Industrial Internet of Things Nodes Based on Double-DAG
With the Industrial Internet of Things (IIoT) continuing to expand, lots of data collection, exchange, and authentication generated from an increasing number of access devices is required with heterogeneity, multidimension, and multiobjective networks as its characteristics. However, traditional IIoT systems are vulnerable to security challenges, such as data leakage, theft, and tampering. As one of the most promising solutions, blockchain has played an essential role in ensuring security and transparency in the IIoT. But there are still some challenges that prevent the secure and effective implementation of blockchain-based IIoT systems in consensus security, consensus efficiency, and consensus application. To address these problems, we propose an effective security blockchain consensus algorithm for heterogeneous IIoT nodes aiming to defend against the consensus attack and improve consensus efficiency. First, we design a blockchain-based IIoT system architecture. Then, we present an identity authentication and transformation protocol to defend against consensus attacks. Furthermore, we introduce a method for constructing communication directed acyclic graphs (DAGs) and transaction set DAGs to enhance transaction throughput. Based on these two DAGs, we propose an efficient and security consensus algorithm (DAG-D). DAG-D employs transaction sets instead of single transactions or blocks, leveraging communication DAG propagation to swiftly confirm transaction set DAGs based on parent transactions for associated confirmation. Experimental results show that our proposed DAG-D outperforms DAG-M, DAG-Avalanche, and DAG-CoDAG, regarding transaction throughput, transaction latency, and communication overhead.
- 4 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 20 (4) , 6300-6312
Efficient and Secure Blockchain Consensus Algorithm for Heterogeneous Industrial Internet of Things Nodes Based on Double-DAG
With the Industrial Internet of Things (IIoT) continuing to expand, lots of data collection, exchange, and authentication generated from an increasing number of access devices is required with heterogeneity, multidimension, and multiobjective networks as its characteristics. However, traditional IIoT systems are vulnerable to security challenges, such as data leakage, theft, and tampering. As one of the most promising solutions, blockchain has played an essential role in ensuring security and transparency in the IIoT. But there are still some challenges that prevent the secure and effective implementation of blockchain-based IIoT systems in consensus security, consensus efficiency, and consensus application. To address these problems, we propose an effective security blockchain consensus algorithm for heterogeneous IIoT nodes aiming to defend against the consensus attack and improve consensus efficiency. First, we design a blockchain-based IIoT system architecture. Then, we present an identity authentication and transformation protocol to defend against consensus attacks. Furthermore, we introduce a method for constructing communication directed acyclic graphs (DAGs) and transaction set DAGs to enhance transaction throughput. Based on these two DAGs, we propose an efficient and security consensus algorithm (DAG-D). DAG-D employs transaction sets instead of single transactions or blocks, leveraging communication DAG propagation to swiftly confirm transaction set DAGs based on parent transactions for associated confirmation. Experimental results show that our proposed DAG-D outperforms DAG-M, DAG-Avalanche, and DAG-CoDAG, regarding transaction throughput, transaction latency, and communication overhead.
- Open Access
A Novel Data-Driven Evaluation Framework for Fork after Withholding Attack in Blockchain Systems
In the blockchain system, mining pools are popular for miners to work collectively and obtain more revenue. Nowadays, there are consensus attacks that threaten the efficiency and security of mining pools. As a new type of consensus attack, the Fork After Withholding (FAW) attack can cause huge economic losses to mining pools. Currently, there are a few evaluation tools for FAW attacks, but it is still difficult to evaluate the FAW attack protection capability of target mining pools. To address the above problem, this paper proposes a novel evaluation framework for FAW attack protection of the target mining pools in blockchain systems. In this framework, we establish the revenue model for mining pools, including honest consensus revenue, block withholding revenue, successful fork revenue, and consensus cost. We also establish the revenue functions of target mining pools and other mining pools, respectively. In particular, we propose an efficient computing power allocation optimization algorithm (CPAOA) for FAW attacks against multiple target mining pools. We propose a model-solving algorithm based on improved Aquila optimization by improving the selection mechanism in different optimization stages, which can increase the convergence speed of the model solution and help find the optimal solution in computing power allocation. Furthermore, to greatly reduce the possibility of falling into local optimal solutions, we propose a solution update mechanism that combines the idea of scout bees in an artificial bee colony optimization algorithm and the constraint of allocating computing power. The experimental results show that the framework can effectively evaluate the revenue of various mining pools. CPAOA can quickly and accurately allocate the computing power of FAW attacks according to the computing power of the target mining pool. Thus, the proposed evaluation framework can effectively help evaluate the FAW attack protection capability of multiple target mining pools and ensure the security of the blockchain system.
Open AccessA Novel Data-Driven Evaluation Framework for Fork after Withholding Attack in Blockchain Systems
In the blockchain system, mining pools are popular for miners to work collectively and obtain more revenue. Nowadays, there are consensus attacks that threaten the efficiency and security of mining pools. As a new type of consensus attack, the Fork After Withholding (FAW) attack can cause huge economic losses to mining pools. Currently, there are a few evaluation tools for FAW attacks, but it is still difficult to evaluate the FAW attack protection capability of target mining pools. To address the above problem, this paper proposes a novel evaluation framework for FAW attack protection of the target mining pools in blockchain systems. In this framework, we establish the revenue model for mining pools, including honest consensus revenue, block withholding revenue, successful fork revenue, and consensus cost. We also establish the revenue functions of target mining pools and other mining pools, respectively. In particular, we propose an efficient computing power allocation optimization algorithm (CPAOA) for FAW attacks against multiple target mining pools. We propose a model-solving algorithm based on improved Aquila optimization by improving the selection mechanism in different optimization stages, which can increase the convergence speed of the model solution and help find the optimal solution in computing power allocation. Furthermore, to greatly reduce the possibility of falling into local optimal solutions, we propose a solution update mechanism that combines the idea of scout bees in an artificial bee colony optimization algorithm and the constraint of allocating computing power. The experimental results show that the framework can effectively evaluate the revenue of various mining pools. CPAOA can quickly and accurately allocate the computing power of FAW attacks according to the computing power of the target mining pool. Thus, the proposed evaluation framework can effectively help evaluate the FAW attack protection capability of multiple target mining pools and ensure the security of the blockchain system.
- Open Access
FAWPA: A FAW Attack Protection Algorithm Based on the Behavior of Blockchain Miners
Blockchain has become one of the key techniques for the security of the industrial internet. However, the blockchain is vulnerable to FAW (Fork after Withholding) attacks. To protect the industrial internet from FAW attacks, this paper proposes a novel FAW attack protection algorithm (FAWPA) based on the behavior of blockchain miners. Firstly, FAWPA performs miner data preprocessing based on the behavior of the miners. Then, FAWPA proposes a behavioral reward and punishment mechanism and a credit scoring model to obtain cumulative credit value with the processed data. Moreover, we propose a miner’s credit classification mechanism based on fuzzy C-means (FCM), which combines the improved Aquila optimizer (AO) with strong solving ability. That is, FAWPA combines the miner’s accumulated credit value and multiple attack features as the basis for classification, and optimizes cluster center selection by simulating Aquila’s predation behavior. It can improve the solution update mechanism in different optimization stages. FAWPA can realize the rapid classification of miners’ credit levels by improving the speed of identifying malicious miners. To evaluate the protective effect of the target mining pool, FAWPA finally establishes a mining pool and miner revenue model under FAW attack. The simulation results show that FAWPA can thoroughly and efficiently detect malicious miners in the target mining pool. FAWPA also improves the recall rate and precision rate of malicious miner detection, and it improves the cumulative revenue of the target mining pool. The proposed algorithm performs better than ND, RSCM, AWRS, and ICRDS.
Open AccessFAWPA: A FAW Attack Protection Algorithm Based on the Behavior of Blockchain Miners
Blockchain has become one of the key techniques for the security of the industrial internet. However, the blockchain is vulnerable to FAW (Fork after Withholding) attacks. To protect the industrial internet from FAW attacks, this paper proposes a novel FAW attack protection algorithm (FAWPA) based on the behavior of blockchain miners. Firstly, FAWPA performs miner data preprocessing based on the behavior of the miners. Then, FAWPA proposes a behavioral reward and punishment mechanism and a credit scoring model to obtain cumulative credit value with the processed data. Moreover, we propose a miner’s credit classification mechanism based on fuzzy C-means (FCM), which combines the improved Aquila optimizer (AO) with strong solving ability. That is, FAWPA combines the miner’s accumulated credit value and multiple attack features as the basis for classification, and optimizes cluster center selection by simulating Aquila’s predation behavior. It can improve the solution update mechanism in different optimization stages. FAWPA can realize the rapid classification of miners’ credit levels by improving the speed of identifying malicious miners. To evaluate the protective effect of the target mining pool, FAWPA finally establishes a mining pool and miner revenue model under FAW attack. The simulation results show that FAWPA can thoroughly and efficiently detect malicious miners in the target mining pool. FAWPA also improves the recall rate and precision rate of malicious miner detection, and it improves the cumulative revenue of the target mining pool. The proposed algorithm performs better than ND, RSCM, AWRS, and ICRDS.