Gen Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Gen Zhang has a total of 40 co-authors. Here are the top co-authors by number of shared publications:
- Pengfei Wang
National university of defense technology, Changsha, China
7 shared publications - Kai Lu
National University of Defense Technology
6 shared publications - Tai Yue
College of Computer, National University of Defense Technology, Changsha, China
5 shared publications - Xu Zhou
College of Computer, National University of Defense Technology, Changsha, China
5 shared publications - Erxue Min
Baidu Inc., Beijing, China
2 shared publications - Lei Zhou
National University of Defense Technology
2 shared publications
Latest Publications
- Open Access
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 19 (19391404) , 12222-12233
SSFDiffusion: A Degradation-Aware Diffusion Model for Ocean Sound Speed Field Super-Resolution
Ocean sound speed field (SSF) is a fundamental geophysical parameter in underwater acoustics and ocean observation, as it plays a critical role in applications such as sonar imaging, underwater communication, and navigation. However, its low spatial resolution limits the performance of these applications in practical scenarios. Super-resolution (SR) techniques provide an effective means to reconstruct high-resolution (HR) SSFs from low-resolution (LR) observations. Nevertheless, most existing SR methods assume a simple, static degradation process, which overlooks the complex and unknown degradation and noise patterns inherent in real marine environments. This oversimplification often results in limited generalization and suboptimal performance in real-world applications. To overcome this limitation, we propose SSFDiffusion, a degradation-aware diffusion model that explicitly models the coupled effects of global degradation and local noise through three core components: (1) a dynamic denoising network adaptive to varying noise levels, (2) a directional multi-scale Transformer for modeling global degradation and local noise, and (3) an alternating optimization strategy that balances degradation correction and noise suppression to prevent artifact accumulation. Extensive experiments on the South China Sea and GDCSM Argo datasets demonstrate that SSFDiffusion consistently outperforms seven state-of-the-art super-resolution methods across five key quantitative metrics. Notably, our method achieves up to 48.52 dB PSNR and an order-of-magnitude RMSE reduction. These experimental results indicate that SSFDiffusion enhances both the spatial fidelity and practical applicability of reconstructed SSF data, benefiting oceanographic research and underwater acoustic applications.
- 23 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing
- Vol. 19 (19391404) , 12222-12233
Open AccessSSFDiffusion: A Degradation-Aware Diffusion Model for Ocean Sound Speed Field Super-Resolution
Ocean sound speed field (SSF) is a fundamental geophysical parameter in underwater acoustics and ocean observation, as it plays a critical role in applications such as sonar imaging, underwater communication, and navigation. However, its low spatial resolution limits the performance of these applications in practical scenarios. Super-resolution (SR) techniques provide an effective means to reconstruct high-resolution (HR) SSFs from low-resolution (LR) observations. Nevertheless, most existing SR methods assume a simple, static degradation process, which overlooks the complex and unknown degradation and noise patterns inherent in real marine environments. This oversimplification often results in limited generalization and suboptimal performance in real-world applications. To overcome this limitation, we propose SSFDiffusion, a degradation-aware diffusion model that explicitly models the coupled effects of global degradation and local noise through three core components: (1) a dynamic denoising network adaptive to varying noise levels, (2) a directional multi-scale Transformer for modeling global degradation and local noise, and (3) an alternating optimization strategy that balances degradation correction and noise suppression to prevent artifact accumulation. Extensive experiments on the South China Sea and GDCSM Argo datasets demonstrate that SSFDiffusion consistently outperforms seven state-of-the-art super-resolution methods across five key quantitative metrics. Notably, our method achieves up to 48.52 dB PSNR and an order-of-magnitude RMSE reduction. These experimental results indicate that SSFDiffusion enhances both the spatial fidelity and practical applicability of reconstructed SSF data, benefiting oceanographic research and underwater acoustic applications.
- Open Access
- 13 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 35 (3) , 1-29
Not All Paths Are Equal: Multi-path Optimization for Directed Hybrid Fuzzing
Directed Grey-Box Fuzzing (DGF) can improve bug exposure efficiency by stressing bug-prone areas. Recent studies have modeled DGF as the problem of finding and optimizing paths to reach target sites. However, they still face the “ multi-path ” challenge. When a target site is reachable by multiple paths, it is crucial to comprehensively evaluate and effectively select these paths, as this affects the fuzzer’s choice between reaching target sites via optimal paths and enhancing path diversity toward targets to expose hidden bugs in non-optimal paths. In this article, we propose MultiGo, a directed hybrid fuzzer designed for multi-path optimization. First, we propose a new fitness metric called path difficulty to comprehensively evaluate the promising paths. This metric uses the Poisson distribution to estimate the probability of exploring basic blocks along execution paths based on statistical block frequency, distinguishing between optimal and challenging paths. With path difficulty as a key factor, a customized Contextual Multi-Armed Bandit (CMAB) model is employed to efficiently optimize path scheduling by comprehensively considering the impact of testing conditions on path scheduling. We introduce the concept of the fuzzing context to represent and evaluate testing conditions, which encompass factors such as path characteristics (e.g., path difficulty), the testing agent (e.g., fuzzing or symbolic execution), and the testing goal (e.g., path exploitation or exploration). Then, the CMAB model predicts the expected rewards for scheduling paths under different testing agents and goals, thereby optimizing path scheduling. By leveraging the CMAB model, MultiGo enhances DGF’s capability to explore easier paths and symbolic execution’s capacity to handle more complex ones, enabling efficient target reaching through optimal paths while ensuring sufficient coverage of non-optimal paths. MultiGo is evaluated on 136 target sites of 41 real-world programs from 3 benchmarks. The experimental results show that MultiGo outperforms the state-of-the-art directed fuzzers (AFLGo, SelectFuzz, Beacon, WindRanger, and DAFL) and hybrid fuzzers (SymCC and SymGo) in reaching target sites and exposing known vulnerabilities. Moreover, MultiGo also discovered 14 undisclosed vulnerabilities.
- 13 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Software Engineering and Methodology
- Vol. 35 (3) , 1-29
Open AccessNot All Paths Are Equal: Multi-path Optimization for Directed Hybrid Fuzzing
Directed Grey-Box Fuzzing (DGF) can improve bug exposure efficiency by stressing bug-prone areas. Recent studies have modeled DGF as the problem of finding and optimizing paths to reach target sites. However, they still face the “ multi-path ” challenge. When a target site is reachable by multiple paths, it is crucial to comprehensively evaluate and effectively select these paths, as this affects the fuzzer’s choice between reaching target sites via optimal paths and enhancing path diversity toward targets to expose hidden bugs in non-optimal paths. In this article, we propose MultiGo, a directed hybrid fuzzer designed for multi-path optimization. First, we propose a new fitness metric called path difficulty to comprehensively evaluate the promising paths. This metric uses the Poisson distribution to estimate the probability of exploring basic blocks along execution paths based on statistical block frequency, distinguishing between optimal and challenging paths. With path difficulty as a key factor, a customized Contextual Multi-Armed Bandit (CMAB) model is employed to efficiently optimize path scheduling by comprehensively considering the impact of testing conditions on path scheduling. We introduce the concept of the fuzzing context to represent and evaluate testing conditions, which encompass factors such as path characteristics (e.g., path difficulty), the testing agent (e.g., fuzzing or symbolic execution), and the testing goal (e.g., path exploitation or exploration). Then, the CMAB model predicts the expected rewards for scheduling paths under different testing agents and goals, thereby optimizing path scheduling. By leveraging the CMAB model, MultiGo enhances DGF’s capability to explore easier paths and symbolic execution’s capacity to handle more complex ones, enabling efficient target reaching through optimal paths while ensuring sufficient coverage of non-optimal paths. MultiGo is evaluated on 136 target sites of 41 real-world programs from 3 benchmarks. The experimental results show that MultiGo outperforms the state-of-the-art directed fuzzers (AFLGo, SelectFuzz, Beacon, WindRanger, and DAFL) and hybrid fuzzers (SymCC and SymGo) in reaching target sites and exposing known vulnerabilities. Moreover, MultiGo also discovered 14 undisclosed vulnerabilities.
- 18 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP, 1
Deadline-Aware Data-Credit-Coupled Transmission for Data Centers
With the rapid development of the Internet of Things (IoT), data centers are facing growing performance demands for flow deadline requirements, other to the low latency and high throughput. To address congestion issues that affect the performance of data center networks, this paper proposes D2C4, a deadline-aware data-credit coupled congestion control scheme. By tightly coupled data-credit integration using an ECN-based feedback loop, D2C4 minimizes credit waste while a credit-driven scheduler meets IoT applications’ flow deadlines. The key innovations of D2C4 include: 1) Data-credit coupling for performance gains; 2) ECN-based credit rate control reducing waste; 3) Deadline-sensitive credit-based flow scheduling to meet flow deadline demands. We conduct extensive experiments of D2C4 through small-scale DPDK-based tests and large-scale OMNeT++ simulations. Experimental results show that D2C4 outperforms existing protocols in flow completion time, throughput, deadline miss ratio, and packet drop.
- 18 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. PP, 1
Deadline-Aware Data-Credit-Coupled Transmission for Data Centers
With the rapid development of the Internet of Things (IoT), data centers are facing growing performance demands for flow deadline requirements, other to the low latency and high throughput. To address congestion issues that affect the performance of data center networks, this paper proposes D2C4, a deadline-aware data-credit coupled congestion control scheme. By tightly coupled data-credit integration using an ECN-based feedback loop, D2C4 minimizes credit waste while a credit-driven scheduler meets IoT applications’ flow deadlines. The key innovations of D2C4 include: 1) Data-credit coupling for performance gains; 2) ECN-based credit rate control reducing waste; 3) Deadline-sensitive credit-based flow scheduling to meet flow deadline demands. We conduct extensive experiments of D2C4 through small-scale DPDK-based tests and large-scale OMNeT++ simulations. Experimental results show that D2C4 outperforms existing protocols in flow completion time, throughput, deadline miss ratio, and packet drop.
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 7137-7152
Efficient Forward-Edge Control-Flow Integrity for COTS Binaries via Arm BTI
Control-Flow Integrity (CFI) has been widely recognized as an effective technique for mitigating control-flow hijacking attacks. However, many binary-level CFI approaches suffer from weaknesses in safeguarding forward edges, particularly for the obfuscated binaries, due to the imprecision in binary analysis or heuristic algorithms. Moreover, these approaches often involve non-negligible overhead and are challenging to deploy, as they instrument plenty of code or employ hardware tracing to enforce the CFI policies. This paper introduces Mobius, the first complete implementation of security-instruction-based binary-only CFI solution on commercial processors. Mobius leverages the Branch Target Identification (BTI) technology in Arm v8.5 to safeguard the forward edges of binaries and shared libraries efficiently. It determines the forward-edge targets without false negatives and carefully instruments the bti instructions to conduct the CFI checking efficiently. Then, it mounts a runtime monitor to detect potential attacks. We deploy Mobius on an Alibaba Cloud server with Yitian 710 processors in practice without modifying the kernel or loader. Remarkably, Mobius successfully provides efficient protection for real-world applications, including obfuscated code, with marginal overhead (5.78% on SPEC2006).
- 16 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Forensics and Security
- Vol. 20 (15566013) , 7137-7152
Efficient Forward-Edge Control-Flow Integrity for COTS Binaries via Arm BTI
Control-Flow Integrity (CFI) has been widely recognized as an effective technique for mitigating control-flow hijacking attacks. However, many binary-level CFI approaches suffer from weaknesses in safeguarding forward edges, particularly for the obfuscated binaries, due to the imprecision in binary analysis or heuristic algorithms. Moreover, these approaches often involve non-negligible overhead and are challenging to deploy, as they instrument plenty of code or employ hardware tracing to enforce the CFI policies. This paper introduces Mobius, the first complete implementation of security-instruction-based binary-only CFI solution on commercial processors. Mobius leverages the Branch Target Identification (BTI) technology in Arm v8.5 to safeguard the forward edges of binaries and shared libraries efficiently. It determines the forward-edge targets without false negatives and carefully instruments the bti instructions to conduct the CFI checking efficiently. Then, it mounts a runtime monitor to detect potential attacks. We deploy Mobius on an Alibaba Cloud server with Yitian 710 processors in practice without modifying the kernel or loader. Remarkably, Mobius successfully provides efficient protection for real-world applications, including obfuscated code, with marginal overhead (5.78% on SPEC2006).
- Open Access
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 73-84
ASC-Hook: Efficient System Call Interception for ARM
- 13 June 2025
- Published by Association for Computing Machinery (ACM)
- p. 73-84
Open AccessASC-Hook: Efficient System Call Interception for ARM
- 18 April 2024
- Published by Elsevier in Computers & Security
- Vol. 142
HyperGo: Probability-based directed hybrid fuzzing
- 18 April 2024
- Published by Elsevier in Computers & Security
- Vol. 142
HyperGo: Probability-based directed hybrid fuzzing
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (7) , 2177-2190
Instiller: Toward Efficient and Realistic RTL Fuzzing
Bugs exist in hardware, such as CPU. Unlike software bugs, these hardware bugs need to be detected before deployment. Previous fuzzing work in CPU bug detection has several disadvantages, e.g., the length of register transition level (RTL) input instructions keeps growing, and longer inputs are ineffective for fuzzing. In this article, we propose Instiller (Instruction Distiller), an RTL fuzzer based on ant colony optimization (ACO). First, to keep the input instruction length short and efficient in fuzzing, it distills input instructions with a variant of ACO (VACO). Next, related work cannot simulate realistic interruptions well in fuzzing, and Instiller solves the problem of inserting interruptions and exceptions in generating the inputs. Third, to further improve the fuzzing performance of Instiller, we propose hardware-based seed selection and mutation strategies. We implement a prototype and conduct extensive experiments against state-of-the-art fuzzing work in real-world target CPU cores. In experiments, Instiller has 29.4% more coverage than DiFuzzRTL. In addition, 17.0% more mismatches are detected by Instiller. With the VACO algorithm, Instiller generates 79.3% shorter input instructions than DiFuzzRTL, demonstrating its effectiveness in distilling the input instructions. In addition, the distillation leads to a 6.7% increase in execution speed on average.
- 31 January 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 43 (7) , 2177-2190
Instiller: Toward Efficient and Realistic RTL Fuzzing
Bugs exist in hardware, such as CPU. Unlike software bugs, these hardware bugs need to be detected before deployment. Previous fuzzing work in CPU bug detection has several disadvantages, e.g., the length of register transition level (RTL) input instructions keeps growing, and longer inputs are ineffective for fuzzing. In this article, we propose Instiller (Instruction Distiller), an RTL fuzzer based on ant colony optimization (ACO). First, to keep the input instruction length short and efficient in fuzzing, it distills input instructions with a variant of ACO (VACO). Next, related work cannot simulate realistic interruptions well in fuzzing, and Instiller solves the problem of inserting interruptions and exceptions in generating the inputs. Third, to further improve the fuzzing performance of Instiller, we propose hardware-based seed selection and mutation strategies. We implement a prototype and conduct extensive experiments against state-of-the-art fuzzing work in real-world target CPU cores. In experiments, Instiller has 29.4% more coverage than DiFuzzRTL. In addition, 17.0% more mismatches are detected by Instiller. With the VACO algorithm, Instiller generates 79.3% shorter input instructions than DiFuzzRTL, demonstrating its effectiveness in distilling the input instructions. In addition, the distillation leads to a 6.7% increase in execution speed on average.
- Open Access
- 16 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 235-240
ReForker: Patching x86_64 Binaries with the Fork Server to Improve Hardware-Assisted Fuzzing through Trampoline-Based Binary Rewriting
Coverage-based Greybox Fuzzing (CGF) is an efficient technique for detecting software vulnerabilities. However, efficient compile-time instrumentation utilized by some fuzzers is not available in testing closed-source binary. Therefore, researchers have proposed hardware-assisted fuzzing to address this. Though enhancing the efficiency in rebuilding coverage, hardware-assisted fuzzing performs poorly on some binaries due to the absence of the fork server, which is an efficient mechanism in modern fuzzers. The program patched with the fork server goes through initialization stages only once during repeated testing, which can significantly improve fuzzing performance. However, existing hardware-assisted fuzzers cannot place the fork server in some (statically linked) binaries. In this paper, we propose ReForker, a trampoline x86_64 binary rewriter to instrument the binary with the fork server for improving the efficiency of hardware-assisted fuzzing. Different from some rewriters in CGF, ReForker focuses on additive instrumentation and is not limited by symbolic information or Position-Independent Executable (PIE) code. It searches the sections in ELF for an executable one as the trampoline section, to insert the fork server. Then ReForker rewrites the instruction storing the address of the main function to redirect the control flow to the fork server, avoiding disturbing the layout of the original code and data sections. The evaluation shows that ReForker effectively works on real-world programs, including statically linked, PIE, and stripped binaries, with only increasing the file size by 4KB and introducing negligible runtime overhead on SPEC INT2006.
- 16 June 2023
- Published by Association for Computing Machinery (ACM)
- p. 235-240
Open AccessReForker: Patching x86_64 Binaries with the Fork Server to Improve Hardware-Assisted Fuzzing through Trampoline-Based Binary Rewriting
Coverage-based Greybox Fuzzing (CGF) is an efficient technique for detecting software vulnerabilities. However, efficient compile-time instrumentation utilized by some fuzzers is not available in testing closed-source binary. Therefore, researchers have proposed hardware-assisted fuzzing to address this. Though enhancing the efficiency in rebuilding coverage, hardware-assisted fuzzing performs poorly on some binaries due to the absence of the fork server, which is an efficient mechanism in modern fuzzers. The program patched with the fork server goes through initialization stages only once during repeated testing, which can significantly improve fuzzing performance. However, existing hardware-assisted fuzzers cannot place the fork server in some (statically linked) binaries. In this paper, we propose ReForker, a trampoline x86_64 binary rewriter to instrument the binary with the fork server for improving the efficiency of hardware-assisted fuzzing. Different from some rewriters in CGF, ReForker focuses on additive instrumentation and is not limited by symbolic information or Position-Independent Executable (PIE) code. It searches the sections in ELF for an executable one as the trampoline section, to insert the fork server. Then ReForker rewrites the instruction storing the address of the main function to redirect the control flow to the fork server, avoiding disturbing the layout of the original code and data sections. The evaluation shows that ReForker effectively works on real-world programs, including statically linked, PIE, and stripped binaries, with only increasing the file size by 4KB and introducing negligible runtime overhead on SPEC INT2006.
- 31 March 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (2) , 405-422
ovAFLow: Detecting Memory Corruption Bugs with Fuzzing-Based Taint Inference
- 31 March 2022
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 37 (2) , 405-422
ovAFLow: Detecting Memory Corruption Bugs with Fuzzing-Based Taint Inference
- 30 November 2021
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 36 (6) , 1248-1268
MEBS: Uncovering Memory Life-Cycle Bugs in Operating System Kernels
- 30 November 2021
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 36 (6) , 1248-1268
MEBS: Uncovering Memory Life-Cycle Bugs in Operating System Kernels