Zhongya 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
Research Subjects
Zhongya Zhang has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Zhiyong Zhang
Information Engineering College, Henan University of Science and Technology, Luoyang, China
7 shared publications - Wenling Wu
Institute of Software, Chinese Academy of Sciences, Beijing, China
4 shared publications - Han Sui
Trusted Computing and Information Assurance Laboratory, Institute of Software, Chinese Academy of Sciences, Beijing, China
3 shared publications - Bolin Wang
Institute of Software, Chinese Academy of Sciences, Beijing, China
2 shared publications - Han Liang
Information Engineering College, Henan University of Science and Technology, Luoyang, China
2 shared publications - Hang Zhang
College of Information Engineering (College of Artificial Intelligence), Henan University of Science and Technology, Luoyang, China
2 shared publications
Latest Publications
- Open Access
- 13 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
- Vol. 10 (4) , 1-28
A Situation-Based Adaptive Defense Framework For IIoT Using Hierarchical Multi-Agent Reinforcement Learning
The deep convergence of Information Technology (IT) and Operational Technology (OT) exposes Industrial Internet of Things (IIoT) systems to complex cross-layer attacks. However, traditional defense methods are mostly designed for a single domain and rely on static or rule-based mechanisms, making them ineffective in capturing cross-layer attack evolution and coordinating adaptive responses. Therefore, this article proposes a Situation-Based Hierarchical Multi-Agent Reinforcement Learning (Situ-HMARL) adaptive defense framework, which formulates defense strategies based on real-time global industrial situations and proactively enhances the resilience of IIoT systems. Firstly, a three-stage industrial situational awareness architecture is proposed to continuously fuse heterogeneous data from the IT and OT layers into a structured Global Industrial Situation Vector (GISV), which serves as a unified global observation space for defense decision-making. Secondly, a lightweight Moving Target Defense (MTD) mechanism is designed to adaptively trigger IP-hopping based on the global industrial situation, thereby reducing overhead while preserving system availability. On this basis, a two-level Hierarchical Multi-Agent Reinforcement Learning (HMARL) framework is developed to decouple perception, decision-making, and enforcement. Low-level agents perform real-time local situational perception and execute defense actions, while a high-level agent reasons over the global industrial situation to generate coordinated defense strategies that minimize system losses. Extensive experiments conducted on the Cyber Operations Research Gym (CybORG) platform validate that the proposed framework effectively mitigates cross-layer attacks and significantly improves the availability of IIoT systems.
- 13 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
- Vol. 10 (4) , 1-28
Open AccessA Situation-Based Adaptive Defense Framework For IIoT Using Hierarchical Multi-Agent Reinforcement Learning
The deep convergence of Information Technology (IT) and Operational Technology (OT) exposes Industrial Internet of Things (IIoT) systems to complex cross-layer attacks. However, traditional defense methods are mostly designed for a single domain and rely on static or rule-based mechanisms, making them ineffective in capturing cross-layer attack evolution and coordinating adaptive responses. Therefore, this article proposes a Situation-Based Hierarchical Multi-Agent Reinforcement Learning (Situ-HMARL) adaptive defense framework, which formulates defense strategies based on real-time global industrial situations and proactively enhances the resilience of IIoT systems. Firstly, a three-stage industrial situational awareness architecture is proposed to continuously fuse heterogeneous data from the IT and OT layers into a structured Global Industrial Situation Vector (GISV), which serves as a unified global observation space for defense decision-making. Secondly, a lightweight Moving Target Defense (MTD) mechanism is designed to adaptively trigger IP-hopping based on the global industrial situation, thereby reducing overhead while preserving system availability. On this basis, a two-level Hierarchical Multi-Agent Reinforcement Learning (HMARL) framework is developed to decouple perception, decision-making, and enforcement. Low-level agents perform real-time local situational perception and execute defense actions, while a high-level agent reasons over the global industrial situation to generate coordinated defense strategies that minimize system losses. Extensive experiments conducted on the Cyber Operations Research Gym (CybORG) platform validate that the proposed framework effectively mitigates cross-layer attacks and significantly improves the availability of IIoT systems.
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. PP (15513203) , 1-12
Differential Random Fault Attack of Ultra-Lightweight Cipher ANU for Industrial Internet
Lightweight ciphers are widely used in the Industrial Internet of Things (IIoT), covering data encryption, communication encryption, and authenticated encryption. Due to their efficiency and low resource consumption, these cryptographic algorithms have become core solutions for network security, yet they still face security challenges. The ANU algorithm, characterized by its small hardware implementation area and low power consumption, is suitable for securing the Industrial Internet of Things (IIoT). In this article, we propose two differential fault attack methods for ANU based on the random nibble and byte models, respectively. Theoretically, the two attacks require 82.4 and 41.2 faults respectively to recover the master key. Simulation results show that the two attacks require 85.66 and 42.86 faults, respectively. The proposed attacks demonstrate significant improvements in terms of analysis difficulty, model applicability, and the number of faults required, offering a new perspective for algorithm security research and evaluation in IIoT environments.
- 12 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. PP (15513203) , 1-12
Differential Random Fault Attack of Ultra-Lightweight Cipher ANU for Industrial Internet
Lightweight ciphers are widely used in the Industrial Internet of Things (IIoT), covering data encryption, communication encryption, and authenticated encryption. Due to their efficiency and low resource consumption, these cryptographic algorithms have become core solutions for network security, yet they still face security challenges. The ANU algorithm, characterized by its small hardware implementation area and low power consumption, is suitable for securing the Industrial Internet of Things (IIoT). In this article, we propose two differential fault attack methods for ANU based on the random nibble and byte models, respectively. Theoretically, the two attacks require 82.4 and 41.2 faults respectively to recover the master key. Simulation results show that the two attacks require 85.66 and 42.86 faults, respectively. The proposed attacks demonstrate significant improvements in terms of analysis difficulty, model applicability, and the number of faults required, offering a new perspective for algorithm security research and evaluation in IIoT environments.
- 19 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 4, 335-345
A Multi-Point Collaborative Defense Method Against Unknown Attacks for Industrial Cyber-Physical Systems
As industrial cyber-physical systems (CPS) become increasingly interconnected and attack methods diversify, industrial equipment remains vulnerable to unknown attacks, potentially causing severe consequences. Traditional single-point defense solutions struggle to counter rapidly emerging unknown threats and fail to meet the practical security and reliability demands of industrial environments. To overcome this limitation, this paper proposes a multi-point collaborative defense framework for unknown attacks for CPS. For single-point defense, a unified unknown attack detection model is deployed to perform independent detection and identification, completing preliminary judgment. In multi-point scenarios, a blockchain-based collaborative defense framework is constructed. When any local detection model identifies an unknown attack, it will initiate a collaborative request via the blockchain. Other collaborative nodes will independently verify the attack and generate a final verdict. A dynamic trust evaluation mechanism has also been designed to assess the trustworthiness and weighting of nodes, thereby effectively suppressing interference from malicious nodes and ensuring the robustness of the collaborative process. Meanwhile, through the model's self-evolution mechanism, continuously optimize the local detection model by using collaboratively validated unknown attack samples to achieve model updates. Experimental results demonstrate that this framework effectively defends against unknown attacks, significantly enhancing detection capabilities and overall system defense levels.
- 19 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Cyber-Physical Systems
- Vol. 4, 335-345
A Multi-Point Collaborative Defense Method Against Unknown Attacks for Industrial Cyber-Physical Systems
As industrial cyber-physical systems (CPS) become increasingly interconnected and attack methods diversify, industrial equipment remains vulnerable to unknown attacks, potentially causing severe consequences. Traditional single-point defense solutions struggle to counter rapidly emerging unknown threats and fail to meet the practical security and reliability demands of industrial environments. To overcome this limitation, this paper proposes a multi-point collaborative defense framework for unknown attacks for CPS. For single-point defense, a unified unknown attack detection model is deployed to perform independent detection and identification, completing preliminary judgment. In multi-point scenarios, a blockchain-based collaborative defense framework is constructed. When any local detection model identifies an unknown attack, it will initiate a collaborative request via the blockchain. Other collaborative nodes will independently verify the attack and generate a final verdict. A dynamic trust evaluation mechanism has also been designed to assess the trustworthiness and weighting of nodes, thereby effectively suppressing interference from malicious nodes and ensuring the robustness of the collaborative process. Meanwhile, through the model's self-evolution mechanism, continuously optimize the local detection model by using collaboratively validated unknown attack samples to achieve model updates. Experimental results demonstrate that this framework effectively defends against unknown attacks, significantly enhancing detection capabilities and overall system defense levels.
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP, 1
Differential Fault Attacks of AEGIS Algorithm Based on Random Bits
AEGIS is a lightweight cipher for resource constrained environments such as the Internet of Things (IoT), which is one of the seven algorithms that ultimately won the CAESAR competition, and has become a focus of cryptographic research. Differential fault attack is a method to recover important secret data by researching the difference in state before and after injecting a fault, which is one of the most serious threats to lightweight cryptographic algorithms. This paper propose differential fault attacks on AEGIS based on the random bit fault model, which theoretically respectively requires only 141, 176, and 246 random bit faults to fully recover the intermediate state of AEGIS-128, AEGIS-256, and AEGIS-L, which are far superior to the known results in terms of the number of faults, computational complexity, and difficulty of models. The attack method on AEGIS contributes to assessing the security of IoT devices and systems, while also guiding the design of IoT security defense strategies. The approach proactively detects vulnerabilities in lightweight cryptographic algorithms implemented on resource-constrained devices such as sensors and smart home chips, thus driving enhancements in algorithms and hardware, and has great significance for the security of IoT platforms.
- 2 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP, 1
Differential Fault Attacks of AEGIS Algorithm Based on Random Bits
AEGIS is a lightweight cipher for resource constrained environments such as the Internet of Things (IoT), which is one of the seven algorithms that ultimately won the CAESAR competition, and has become a focus of cryptographic research. Differential fault attack is a method to recover important secret data by researching the difference in state before and after injecting a fault, which is one of the most serious threats to lightweight cryptographic algorithms. This paper propose differential fault attacks on AEGIS based on the random bit fault model, which theoretically respectively requires only 141, 176, and 246 random bit faults to fully recover the intermediate state of AEGIS-128, AEGIS-256, and AEGIS-L, which are far superior to the known results in terms of the number of faults, computational complexity, and difficulty of models. The attack method on AEGIS contributes to assessing the security of IoT devices and systems, while also guiding the design of IoT security defense strategies. The approach proactively detects vulnerabilities in lightweight cryptographic algorithms implemented on resource-constrained devices such as sensors and smart home chips, thus driving enhancements in algorithms and hardware, and has great significance for the security of IoT platforms.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (1) , 1
Differential Fault Attack of Lightweight Cipher GIFT Based on Byte Model
GIFT, as a lightweight block cipher algorithm, is mainly suitable for resource-constrained environments, such as the Internet of Things, to achieve efficient cryptographic communication. For the diffusion characteristics of round function of GIFT algorithm, this paper proposes two byte-based differential fault attack models. Theoretically, the first and second models require 53.44 and 12.42 byte faults to recover the master key. Experimental results show that the first and second models require about 79 and 16 byte faults, respectively, to recover the master key. The models proposed in this paper have made significant breakthroughs in terms of both the attack range and the number of required faults, which provide important guidance for algorithmic security research and the design of fault-tolerant mechanisms for IoT devices.
- 17 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP (1) , 1
Differential Fault Attack of Lightweight Cipher GIFT Based on Byte Model
GIFT, as a lightweight block cipher algorithm, is mainly suitable for resource-constrained environments, such as the Internet of Things, to achieve efficient cryptographic communication. For the diffusion characteristics of round function of GIFT algorithm, this paper proposes two byte-based differential fault attack models. Theoretically, the first and second models require 53.44 and 12.42 byte faults to recover the master key. Experimental results show that the first and second models require about 79 and 16 byte faults, respectively, to recover the master key. The models proposed in this paper have made significant breakthroughs in terms of both the attack range and the number of required faults, which provide important guidance for algorithmic security research and the design of fault-tolerant mechanisms for IoT devices.
- Open Access
- 14 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
- Vol. 8 (1) , 1-20
A Combinatorial Optimization Analysis Method for Detecting Malicious Industrial Internet Attack Behaviors
Industrial Internet plays an important role in key critical infrastructure sectors and is the target of different security threats and risks. There are limitations in many existing attack detection approaches, such as function redundancy, overfitting, and low efficiency. A combinatorial optimization method—Lagrange multiplier—is designed to optimize the underlying feature screening algorithm. The optimized feature combination is fused with random forest and XG-Boost selected features to improve the accuracy and efficiency of attack feature analysis. Using both the UNSW-NB15 and natural gas pipeline datasets, we evaluate the performance of the proposed method. It is observed that the influence degrees of the different features associated with the attack behavior can result in the binary classification attack detection increasing to 0.93 and the attack detection time reducing by 6.96 times. The overall accuracy of multi-classification attack detection is also observed to improve by 0.11. We also observe that nine key features of attack behavior analysis are essential to the analysis and detection of general attacks targeting the system, and by focusing on these features one could potentially improve the effectiveness and efficiency of real-time critical industrial system security. In this article, the CICDDoS2019 and CICIDS2018 datasets are used to prove the generalization. The experimental results show that the proposed method has good generalization and can be extended to the same type of industrial anomaly datasets.
- 14 January 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Cyber-Physical Systems
- Vol. 8 (1) , 1-20
Open AccessA Combinatorial Optimization Analysis Method for Detecting Malicious Industrial Internet Attack Behaviors
Industrial Internet plays an important role in key critical infrastructure sectors and is the target of different security threats and risks. There are limitations in many existing attack detection approaches, such as function redundancy, overfitting, and low efficiency. A combinatorial optimization method—Lagrange multiplier—is designed to optimize the underlying feature screening algorithm. The optimized feature combination is fused with random forest and XG-Boost selected features to improve the accuracy and efficiency of attack feature analysis. Using both the UNSW-NB15 and natural gas pipeline datasets, we evaluate the performance of the proposed method. It is observed that the influence degrees of the different features associated with the attack behavior can result in the binary classification attack detection increasing to 0.93 and the attack detection time reducing by 6.96 times. The overall accuracy of multi-classification attack detection is also observed to improve by 0.11. We also observe that nine key features of attack behavior analysis are essential to the analysis and detection of general attacks targeting the system, and by focusing on these features one could potentially improve the effectiveness and efficiency of real-time critical industrial system security. In this article, the CICDDoS2019 and CICIDS2018 datasets are used to prove the generalization. The experimental results show that the proposed method has good generalization and can be extended to the same type of industrial anomaly datasets.
- 29 April 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (8) , 2687-2704
Post-quantum security on the Lai–Massey scheme
- 29 April 2023
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 91 (8) , 2687-2704
Post-quantum security on the Lai–Massey scheme
- Open Access
- 1 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 32 (2) , 209-216
Quantum Attacks on Type-3 Generalized Feistel Scheme and Unbalanced Feistel Scheme with Expanding Functions
Quantum algorithms are raising concerns in the field of cryptography all over the world. A growing number of symmetric cryptography algorithms have been attacked in the quantum setting. Type-3 generalized Feistel scheme (GFS) and unbalanced Feistel scheme with expanding functions (UFS-E) are common symmetric cryptography schemes, which are often used in cryptographic analysis and design. We propose quantum distinguishing attacks on Type-3 GFS and UFS-E in the quantum chosen plaintext attack setting. The results of key recovery are better than those based on exhaustive search in the quantum setting.
- 1 March 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Chinese Journal of Electronics
- Vol. 32 (2) , 209-216
Open AccessQuantum Attacks on Type-3 Generalized Feistel Scheme and Unbalanced Feistel Scheme with Expanding Functions
Quantum algorithms are raising concerns in the field of cryptography all over the world. A growing number of symmetric cryptography algorithms have been attacked in the quantum setting. Type-3 generalized Feistel scheme (GFS) and unbalanced Feistel scheme with expanding functions (UFS-E) are common symmetric cryptography schemes, which are often used in cryptographic analysis and design. We propose quantum distinguishing attacks on Type-3 GFS and UFS-E in the quantum chosen plaintext attack setting. The results of key recovery are better than those based on exhaustive search in the quantum setting.
- 18 June 2022
- Published by Springer Nature in Quantum Information Processing
- Vol. 21 (6) , 1-20
Quantum generic attacks on key-alternating Feistel ciphers for shorter keys
- 18 June 2022
- Published by Springer Nature in Quantum Information Processing
- Vol. 21 (6) , 1-20
Quantum generic attacks on key-alternating Feistel ciphers for shorter keys