Jun Zeng 0006

dblp:04/1346-6 · DBLP profile ↗
← Back
13ranked-venue papers
3as first author
13since 2021 · last 2025
0009-0004-3471-9504ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 9 · 3 first-author · 9 since 2021Software engineering, systems software and programming languages · 3 · 3 since 2021Systems, architecture and hardware · 1 · 1 since 2021
YearPublicationVenuePosition
2025 UI-CTX: Understanding UI Behaviors with Code Contexts for Mobile Applications
Jiahao Liu 0005, Jun Zeng 0006, Zhenkai Liang
NDSS4
2025 ProvGuard: Detecting SDN Control Policy Manipulation via Contextual Semantics of Provenance Graphs
Jun Zeng 0006, Qixiao Lin, Jiahao Liu 0005, Jianwei Zhuge, Zhenkai Liang
NDSS3
2024 The HitchHiker's Guide to High-Assurance System Observability Protection with Efficient Permission Switches
abstract
Protecting system observability records (logs) from compromised OSs has gained significant traction in recent times, with several note-worthy approaches proposed. Unfortunately, none of the proposed approaches achieve high performance with tiny log protection delays. They also leverage risky environments for protection (e.g., many use general-purpose hypervisors or TrustZone, which have large TCB and attack surfaces). HitchHiker is an attempt to rectify this problem. The system is designed to ensure (a) in-memory protection of batched logs within a short and configurable real-time deadline by efficient hardware permission switching, and (b) an end-to-end high-assurance environment built upon hardware protection primitives with debloating strategies for secure log protection, persistence, and management. Security evaluations and validations show that HitchHiker reduces log protection delay by 93.3--99.3% compared to the state-of-the-art, while reducing TCB by 9.4--26.9X. Performance evaluations show HitchHiker incurs a geometric mean of less than 6% overhead on diverse real-world programs, improving on the state-of-the-art approach by 61.9--77.5%.
Chuqi Zhang, Jun Zeng 0006, Yiming Zhang 0030, Adil Ahmad, Fengwei Zhang, Hai Jin 0001, Zhenkai Liang
CCS2
2024 Automatic Root Cause Analysis via Large Language Models for Cloud Incidents
abstract
Ensuring the reliability and availability of cloud services necessitates efficient root cause analysis (RCA) for cloud incidents. Traditional RCA methods, which rely on manual investigations of data sources such as logs and traces, are often laborious, error-prone, and challenging for on-call engineers. In this paper, we introduce RCACopilot, an innovative on-call system empowered by the large language model for automating RCA of cloud incidents. RCACopilot matches incoming incidents to corresponding incident handlers based on their alert types, aggregates the critical runtime diagnostic information, predicts the incident's root cause category, and provides an explanatory narrative. We evaluate RCACopilot using a real-world dataset consisting of a year's worth of incidents from Microsoft. Our evaluation demonstrates that RCACopilot achieves RCA accuracy up to 0.766. Furthermore, the diagnostic information collection component of RCACopilot has been successfully in use at Microsoft for over four years.
Yinfang Chen, Huaibing Xie, Minghua Ma, Yu Kang 0006, Xin Gao 0017, Liu Shi, Yunjie Cao, Xuedong Gao, Ming Wen 0001, Jun Zeng 0006, Supriyo Ghosh, Xuchao Zhang, Chaoyun Zhang, Qingwei Lin, Saravan Rajmohan, Dongmei Zhang 0001, Tianyin Xu
EuroSys11
2024 MaskDroid: Robust Android Malware Detection with Masked Graph Representations
abstract
Android malware attacks have posed a severe threat to mobile users, necessitating a significant demand for the automated detection system. Among the various tools employed in malware detection, graph representations (e.g., function call graphs) have played a pivotal role in characterizing the behaviors of Android apps. However, though achieving impressive performance in malware detection, current state-of-the-art graph-based malware detectors are vulnerable to adversarial examples. These adversarial examples are meticulously crafted by introducing specific perturbations to normal malicious inputs. To defend against adversarial attacks, existing defensive mechanisms are typically supplementary additions to detectors and exhibit significant limitations, often relying on prior knowledge of adversarial examples and failing to defend against unseen types of attacks effectively. In this paper, we propose MASKDROID, a powerful detector with a strong discriminative ability to identify malware and remarkable robustness against adversarial attacks. Specifically, we introduce a masking mechanism into the Graph Neural Network (GNN) based framework, forcing MASKDROID to recover the whole input graph using a small portion (e.g., 20%) of randomly selected nodes.This strategy enables the model to understand the malicious semantics and learn more stable representations, enhancing its robustness against adversarial attacks. While capturing stable malicious semantics in the form of dependencies inside the graph structures, we further employ a contrastive module to encourage MASKDROID to learn more compact representations for both the benign and malicious classes to boost its discriminative power in detecting malware from benign apps and adversarial examples.
Jingnan Zheng, Jiahao Liu 0005, An Zhang 0003, Jun Zeng 0006, Zhenkai Liang, Tat-Seng Chua
ASE4
2024 UIHash: Detecting Similar Android UIs through Grid-Based Visual Appearance Representation
Jun Zeng 0006, Qixiao Lin, Shaowen Feng, Zhenkai Liang
USENIX Security Symposium3
2023 Learning Graph-based Code Representations for Source-level Functional Similarity Detection
abstract
Detecting code functional similarity forms the basis of various software engineering tasks. However, the detection is challenging as functionally similar code fragments can be implemented differently, e.g., with irrelevant syntax. Recent studies incorporate program dependencies as semantics to identify syntactically different yet semantically similar programs, but they often focus only on local neighborhoods (e.g., one-hop dependencies), limiting the expressiveness of program semantics in modeling functionalities. In this paper, we present Tailor that explicitly exploits deep graph-structured code features for functional similarity detection. Given source-level programs, Tailor first represents them into code property graphs (CPGs) - which combine abstract syntax trees, control flow graphs, and data flow graphs - to collectively reason about program syntax and semantics. Then, Tailor learns representations of CPGs by applying a CPG-based neural network (CPGNN) to iteratively propagate information on them. It improves over prior work on code representation learning through a new graph neural network (GNN) tailored to CPG structures instead of the off-the-shelf GNNs used previously. We systematically evaluate Tailor on C and Java programs using two public benchmarks. Experimental results show that Tailor outperforms the state-of-the-art approaches, achieving 99.8% and 99.9% F-scores in code clone detection and 98.3% accuracy in source code classification.
Jiahao Liu 0005, Jun Zeng 0006, Xiang Wang 0010, Zhenkai Liang
ICSE2
2022 PalanTír: Optimizing Attack Provenance with Hardware-enhanced System Observability
abstract
System auditing is the foundation of attack provenance to investigate root causes and ramifications of cyber-attacks. However, provenance tracking on coarse-grained audit logs suffers from false causalities caused by dependency explosion. Recent approaches address this problem by increasing provenance granularity using execution partitioning or record-and-replay techniques. Unfortunately, they require program instrumentation and/or impose an unaffordable overhead, which is not practical in deployment.
Jun Zeng 0006, Chuqi Zhang, Zhenkai Liang
CCS1
2022 AttacKG: Constructing Technique Knowledge Graph from Cyber Threat Intelligence Reports
Zhenyuan Li, Jun Zeng 0006, Yan Chen 0004, Zhenkai Liang
ESORICS (1)2
2022 TeLL: log level suggestions via modeling multi-level code block information
abstract
Developers insert logging statements into source code to monitor system execution, which forms the basis for software debugging and maintenance. For distinguishing diverse runtime information, each software log is assigned with a separate verbosity level (e.g., trace and error). However, choosing an appropriate verbosity level is a challenging and error-prone task due to the lack of specifications for log level usages. Prior solutions aim to suggest log levels based on the code block in which a logging statement resides (i.e., intra-block features). Such suggestions, however, do not consider information from surrounding blocks (i.e., inter-block features), which also plays an important role in revealing logging characteristics.
Jiahao Liu 0005, Jun Zeng 0006, Xiang Wang 0010, Kaihang Ji, Zhenkai Liang
ISSTA2
2022 SHADEWATCHER: Recommendation-guided Cyber Threat Analysis using System Audit Records
abstract
System auditing provides a low-level view into cyber threats by monitoring system entity interactions. In response to advanced cyber-attacks, one prevalent solution is to apply data provenance analysis on audit records to search for anomalies (anomalous behaviors) or specifications of known attacks. However, existing approaches suffer from several limitations: 1) generating high volumes of false alarms, 2) relying on expert knowledge, or 3) producing coarse-grained detection signals. In this paper, we recognize the structural similarity between threat detection in cybersecurity and recommendation in information retrieval. By mapping security concepts of system entity interactions to recommendation concepts of user-item interactions, we identify cyber threats by predicting the preferences of a system entity on its interactive entities. Furthermore, inspired by the recent advances in modeling high-order connectivity via item side information in the recommendation, we transfer the insight to cyber threat analysis and customize an automated detection system, SHADEWATCHER. It fulfills the potential of high-order information in audit records via graph neural networks to improve detection effectiveness. Besides, we equip SHADEWATCHER with dynamic updates towards better generalization to false alarms. In our evaluation against both real-life and simulated cyber-attack scenarios, SHADEWATCHER shows its advantage in identifying threats with high precision and recall rates. Moreover, SHADEWATCHER is capable of pinpointing threats from nearly a million system entity interactions within seconds.
Jun Zeng 0006, Xiang Wang 0010, Jiahao Liu 0005, Yinfang Chen, Zhenkai Liang, Tat-Seng Chua, Zheng Leong Chua
SP1
2022 FlowMatrix: GPU-Assisted Information-Flow Analysis through Matrix-Based Representation
Kaihang Ji, Jun Zeng 0006, Yuancheng Jiang, Zhenkai Liang, Zheng Leong Chua, Prateek Saxena, Abhik Roychoudhury
USENIX Security Symposium2
2021 WATSON: Abstracting Behaviors from Audit Logs via Aggregation of Contextual Semantics
Jun Zeng 0006, Zheng Leong Chua, Yinfang Chen, Kaihang Ji, Zhenkai Liang
NDSS1