23 April 2019 in IEEE Access
Packing is the most common malware obfuscation technique employed to evade detection by anti-virus systems. With the explosive growth of packed malware, packer identification has become increasingly important in current cybersecurity. Most prior researches lack resilience since they neglect the significance of preserving the semantic integrity for pursuing efficiency. Therefore, in this paper, we propose a novel approach based on consistently-executing graph (CEG) mining, which can maximise semantics and facilitate the execution intents of executables for identification. We elaborate on the concepts of consistent execution and represent malware packers as structured CEGs. Then we employ the bipartite matching algorithm built on a designed block proximity metric to extract the critical matching subgraphs. Weisfeiler-Lehman shortest path graph kernel is adopted for pairwise comparison to make the prediction. We have evaluated the efficacy extensively with several experiments on large-scale datasets containing manually-packed benign apps, wild-packed malware and wild-unpacked malware. Promising results demonstrate that our approach is valid and practical when applied to real-world packed malware analysis.
22 April 2025 in IEEE Transactions on Information Forensics and Security
The Linux kernel remains vulnerable to numerous bugs, with approximately 65% detected by Syzkaller lacking Proof-of-Concept (PoC), hampering risk mitigation efforts. These bugs, termed irreproducible kernel bugs, highlight the challenge of statefulness issue-related irreproducibility in kernel fuzzing, which is an open research without definitive solutions. Our investigation reveals that suboptimal seed quality distribution in fuzzing is the root obstacle preventing effective tracking of the states leading to crashes. Inspired by this insight, we introduce Reverse Fuzzing (RF), an innovative approach that infers hard-to- reach states by continuously reverse-oriented deriving from subsequently encountered bridge states to increase reproduction probability. RF differentiates between the “trigger” seed, which directly causes crashes, and “activator” seeds, which establish the necessary preconditions, prioritizing exploration around trigger while simultaneously regenerating and maintaining activators during fuzzing, which effectively facilitate to restructure such elusive states from “yesterday”. We implement YOME, a prototype leveraging RF to strike a balance between fuzzing efficiency and effectiveness through customized scheduling and mutation strategies, armed with a refinement mechanism to improve seed quality distribution. Our evaluations validate that YOME reproduce 110% more bugs than previous kernel fuzzers and demonstrate its practicality in real-world scenarios. YOME generated 125 PoCs (30.1% of the total) and uncovered 23 unique bugs, with 40 confirmed and 5 assigned CVEs.