EDBT 2026 Demo / reviewers in the wild / expert
Tiantian Zhu 0001
dblp:153/5745-1
· DBLP profile ↗
51ranked-venue papers
11as first author
46since 2021 · last 2026
0000-0002-8657-662XORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 31 · 6 first-author · 28 since 2021Computer networks · 10 · 4 first-author · 8 since 2021Artificial intelligence and machine learning · 6 · 1 first-author · 6 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | FaaSGuard: An Adaptive Framework for Obfuscating Function Activity States in Serverless Applications
Xue Leng, Fengming Zhu, Xing Li 0001, Tiantian Zhu 0001 |
INFOCOM | 4 |
| 2026 | APT-CGLP: Advanced Persistent Threat Hunting via Contrastive Graph-Language Pre-TrainingabstractProvenance-based threat hunting identifies Advanced Persistent Threats (APTs) on endpoints by correlating attack patterns described in Cyber Threat Intelligence (CTI) with provenance graphs derived from system audit logs. A fundamental challenge in this paradigm lies in the modality gap —the structural and semantic disconnect between provenance graphs and CTI reports. Prior work addresses this by framing threat hunting as a graph matching task: 1) extracting attack graphs from CTI reports, and 2) aligning them with provenance graphs. However, this pipeline incurs severe information loss during graph extraction and demands intensive manual curation, undermining scalability and effectiveness. Xuebo Qiu, Mingqi Lv, Yimei Zhang 0003, Tieming Chen, Tiantian Zhu 0001, Qijie Song, Shouling Ji |
KDD (1) | 5 |
| 2026 | ProHunter: A comprehensive APT hunting system based on whole-system provenance
Xuebo Qiu, Mingqi Lv, Tiantian Zhu 0001, Yimei Zhang 0003, Tieming Chen |
Comput. Secur. | 3 |
| 2026 | BGF-DR: bidirectional greybox fuzzing for DNS resolver vulnerability discovery
Ruoxi Chen, Hongxin Su, Tiantian Zhu 0001 |
Comput. Secur. | 5 |
| 2026 | Lotldetector: living off the land attacks detection system based on feature fusionabstractAbstract In recent years, Living off the Land (LotL) attacks have been drawing attention due to their flexibility and difficulty in detection. These attacks exploit legitimate tools already in the system to conduct malicious activities, hiding their malicious intent behind normal benign programs. However, detection methods for such attacks largely rely on expert rules. While rule tags can effectively detect known attacks, this also leads to a high false positive rate, resulting in low detection accuracy for the models. To address these issues, we propose a detection system called LOTLDetector, which combines deep learning methods with expert rules to detect malicious command lines in LotL attacks from both data and knowledge perspectives. LOTLDetector learns the semantics of command line text through neural networks and combines rule tags from expert knowledge, enabling a more comprehensive detection of LotL attacks. We extensively evaluated our method, validated it on a Windows dataset containing 27,448 command lines and a Linux dataset containing 27,093 command lines, and compared it with existing methods. The results show that our method significantly outperforms existing methods in detecting malicious command lines. For the Linux dataset, the detection system achieved a detection performance with an accuracy of 0.9728; for the Windows dataset, the system’s detection accuracy also reached 0.9598, which is about 8% higher than the best existing method. In addition, our project has been open-sourced at https://github.com/csedikaf/LOTLDetector . Tiantian Zhu 0001, Tieming Chen, Mingqi Lv, Chun-lin Xiong, Zhengqiu Weng, Xiangyang Zheng |
Cybersecur. | 1 |
| 2026 | UniProv: A unified pretraining framework for provenance graph representation learning
Xuebo Qiu, Mingqi Lv, Yimei Zhang 0003, Qijie Song, Tiantian Zhu 0001, Tieming Chen |
Neurocomputing | 5 |
| 2026 | Provenance-based advanced persistent threat detection via holistic contrastive learning with heuristic augmentation
Xuebo Qiu, Mingqi Lv, Tiantian Zhu 0001, Qijie Song, Tieming Chen |
J. Inf. Secur. Appl. | 3 |
| 2026 | SLATSCOG: A secure authentication framework via federated data generation and temporally-enhanced split learning
Tiantian Zhu 0001, Zhengqiu Weng, Zhizhong Ma, Suyu Zhang |
Knowl. Based Syst. | 2 |
| 2026 | ProGrasp: Storage-efficient provenance graph compression for APT forensics via structure prediction and attribute aggregation
Tiantian Zhu 0001, Yiqian Yang, Zhengqiu Weng, Haofei Sun, Zhizhong Ma, Guolang Chen |
Knowl. Based Syst. | 1 |
| 2026 | Zoomer: An APT TTP Recognition System via Deep & Wide Provenance Graph LearningabstractAdvanced Persistent Threats (APTs) commonly manifest through a sequence of attack steps, known as Tactics, Techniques, and Procedures (TTPs). Recent studies identify TTPs by converting audit logs into causal provenance graphs and applying expert-driven mappings that correlate low-level system events with high-level TTP patterns. However, these methods face persistent challenges: determining the impact boundaries of TTP activities, adapting to evolving TTP stacks, and recognizing fine-grained TTP semantics for deeper forensic insights. To address these challenges, we presentZoomer, a novel TTP recognition framework that segments provenance graphs into multiple TTP subgraphs with multi-granular annotations (i.e., tactics, techniques, and sub-techniques). First, we devise a heuristic subgraph sampling algorithm guided by anomalous node detection to precisely delineate the scope of TTP activities. Second, we introduce a dual-tower Deep & Wide architecture that integrates contextual behavior semantics from provenance graphs and domain-informed features to learn expressive TTP representations. Finally, we adopt a prototypical network that reformulates TTP recognition as a few-shot pattern matching task, thereby enhancing adaptability and accuracy under limited supervision. To advance future research, we built and released the first TTP-annotated provenance dataset, encompassing the most comprehensive collection of TTP instances to date. Extensive experiments show thatZoomerachieves TTP recognition with 88% accuracy at the sub-technique level and 94% at the tactic level, significantly outperforming state-of-the-art baselines. Xuebo Qiu, Mingqi Lv, Tieming Chen, Tiantian Zhu 0001, Qijie Song, Zhiling Zhu |
IEEE Trans. Dependable Secur. Comput. | 4 |
| 2026 | SParse: Semantic Tracking and Path Analysis for Attack Investigation in Real-TimeabstractAs Advanced Persistent Threats (APTs) become more complex and destructive, attack investigation has gained importance. Analysts use provenance graphs for causality analysis on Point-Of-Interest (POI) events to capture critical events. However, existing methods suffer from problems of high false positives, high overhead, and high latency due to the vast size of the provenance graph and the rarity of critical events. We proposeSPARSEfor constructing critical component graphs (i.e., consisting of critical events) from streaming logs in real time. Our approach is based on two key observations: 1) Critical events exist in suspicious semantic graphs (SSGs) composed of interaction flows between suspicious entities, and 2) Information flows accomplishing the attacker's goal exist as paths.SPARSEuses a two-stage framework that first constructs the SSG using a state-based mode with semantic transfer rules and storage strategies. Then, it identifies suspicious flow paths (SFPs) related to the POI event and quantifies each path's influence to filter irrelevant events. Evaluation on a large-scale attack dataset shows our system generates a critical component graph ($\sim$113 edges) in 1.6 seconds, which is 2014 × smaller than the backtracking graph ($\sim$227,589 edges). It is also 25 × more effective in filtering irrelevant edges compared to other state-of-the-art techniques. Tiantian Zhu 0001, Wenrui Cheng, Qixuan Yuan, Chun-lin Xiong, Tieming Chen, Mingqi Lv, Yan Chen 0004 |
IEEE Trans. Dependable Secur. Comput. | 2 |
| 2026 | MADGuard: A High-Performance Microservice Anomaly Detection System With Multidimensional Data Fusion and Temporal Causal AnalysisabstractWith the widespread adoption of microservice architectures, the security threats they face have become increasingly sophisticated. Existing anomaly detection methods based on system calls exhibit significant limitations in three key aspects: multidimensional data fusion, temporal causality modeling, and forensic analysis of anomalies. This paper proposes MADGuard, a provenance graph-based anomaly detection system for microservices. MADGuard addresses these challenges through three key innovations: (1) It constructs a native provenance graph by integrating multisource services and multidimensional data, employing feature hashing and positional encoding for efficient graph representation; (2) The system introduces a Temporal Graph Network (TGN) model combined with edge reconstruction error and Inverse Document Frequency (IDF) weighting, achieving a 15. 07% improvement in the F1 score compared to existing methods; (3) For the first time in microservice security, an integrated forensic analysis module is implemented, allowing rapid anomaly path reconstruction through aggregated anomaly subgraphs. Comprehensive evaluations on typical microservice benchmarks (TeaStore, RobotShop, SockShop) demonstrate MADGuard’s superior performance: 94.08% detection accuracy, significantly outperforming state-of-the-art approaches while maintaining practical operational efficiency. Yanshang Yin, Tiantian Zhu 0001, Tieming Chen, Mingqi Lv |
IEEE Trans. Netw. Serv. Manag. | 2 |
| 2026 | PROPHET: Efficient and Intelligent Orchestrator for Microservices Scheduling and ScalingabstractMicroservices are popular and widely used in the cloud. However, realizing cost-effective and high-performance microservice orchestration is challenging for Cloud Service Providers (CSPs). Current orchestration mechanisms have limited flexibility and resource efficiency in scheduling and would cause sluggishness in scaling, which brings unnecessary costs to CSP. This paper presents PROPHET, a microservice orchestrator for optimizing service scheduling and scaling. To improve scheduling flexibility and resource utilization, we propose aranking-based p-batch scheduling mechanism, which adopts a pairwise ranker to obtain resource-efficient scheduling plans for large-scale microservice applications rapidly. To advance the scaling agility, we design aproactive prediction-based scaling mechanism, which performs scaling in advance based on resource usage prediction. Our evaluations are conducted on a real-world cluster with the public Alibaba cluster dataset and datasets collected from the cluster. The results indicate that PROPHET can significantly reduce the number of nodes running in the cluster and improve scaling. This shows great potential in achieving cost-effective and high-performance microservice orchestration. Xue Leng, Chengxuan Zhu, Fengming Zhu, Kaiwen Shen, Tiantian Zhu 0001, Yan Chen 0004 |
IEEE Trans. Netw. | 6 |
| 2025 | Defense Against Model Stealing Based on Account-Aware Distribution DiscrepancyabstractMalicious users attempt to replicate commercial models functionally at low cost by training a clone model with query responses. It is challenging to timely prevent such model-stealing attacks to achieve strong protection and maintain utility. In this paper, we propose a novel non-parametric detector called Account-aware Distribution Discrepancy (ADD) to recognize queries from malicious users by leveraging account-wise local dependency. We formulate each class as a Multivariate Normal distribution (MVN) in the feature space and measure the malicious score as the sum of weighted class-wise distribution discrepancy. The ADD detector is combined with random-based prediction poisoning to yield a plug-and-play defense module named D-ADD for image classification models. Results of extensive experimental studies show that D-ADD achieves strong defense against different types of attacks with little interference in serving benign users for both soft and hard-label settings. Jian-Ping Mei, Xuyun Zhang, Tiantian Zhu 0001 |
AAAI | 5 |
| 2025 | Poster: Leveraging Large Language Models to Effectively and Efficiently Identify Vulnerability Patches for WordPress PluginsabstractVulnerability patches are essential for managing vulnerabilities in Open-source software (OSS). However, accurately identifying them remains difficult. Existing methods mainly rely on rule-based matching and are not well-suited to ecosystems like WordPress plugins, due to the lack of a unified development standard. In contrast, methods that combine vulnerability descriptions with code changes demonstrate greater potential. However, current prediction models lack deep semantic understanding and thus cannot fully understand the meaning behind the changes. Xue Leng, Tiantian Zhu 0001 |
CCS | 3 |
| 2025 | Provenance-Based Intrusion Detection via Multi-scale Graph Representation Learning
Xuebo Qiu, Mingqi Lv, Tieming Chen, Tiantian Zhu 0001, Qijie Song |
ICICS (2) | 4 |
| 2025 | Kellect: A Kernel-based efficient and lossless event log collector for windows security
Tieming Chen, Qijie Song, Tiantian Zhu 0001, Xuebo Qiu, Zhiling Zhu, Mingqi Lv |
Comput. Secur. | 3 |
| 2025 | PDCleaner: A multi-view collaborative data compression method for provenance graph-based APT detection systems
Jiaobo Jin, Tiantian Zhu 0001, Qixuan Yuan, Tieming Chen, Mingqi Lv, Chenbin Zheng, Jian-Ping Mei |
Comput. Secur. | 2 |
| 2025 | HER-PT: An intelligent penetration testing framework with Hindsight Experience Replay
Tiantian Zhu 0001, Haoqi Yan, Tieming Chen, Mingqi Lv |
Comput. Secur. | 2 |
| 2025 | MIRDETECTOR: Applying malicious intent representation for enhanced APT anomaly detection
Tiantian Zhu 0001, Tieming Chen, Mingqi Lv, Jian-Ping Mei, Zhengqiu Weng, Lili Shi |
Comput. Secur. | 2 |
| 2025 | LinTracer: An efficient tracking system for cyberattack chains fusing entity and event semantics
Tiantian Zhu 0001, Wenya He, Tieming Chen, Jiabo Zhang, Mingqi Lv, Aohan Zheng, Xiangyang Zheng, Zhengqiu Weng, Shuying Wu |
Comput. Secur. | 1 |
| 2025 | An Interpretable Network Intrusion Detection Model via Decision Tree Enhanced Deep Attention NetworkabstractNetwork intrusion detection (NID) plays a crucial role in cybersecurity by identifying network attacks from network traffic. In recent years, the deep learning technique has become a tendency for the NID problem. However, a major drawback of deep learning is the lack of interpretability, making NID systems (NIDSs) difficult to diagnose and response to the detected network attacks. At the same time, the existing interpretable deep learning techniques cannot adapt to the NID problem due to its specific challenges, including the cross‐feature effect and the absence of self‐interpretable features. To this end, this article proposes a decision Tree enhanced deep Attention Network (TAN), an interpretable deep learning model specifically designed for the NID problem by integrating a decision tree (DT) into a deep attention network. TAN utilizes a DT to extract self‐interpretable features and then uses a deep hierarchical attention network to capture the cross‐feature effect and pinpoint the most important self‐interpretable features. A series of experiments and case studies were performed on public datasets, including KDD99, NSL‐KDD, UNSW‐NB15, and CICIDS2017. The results indicate that TAN achieves competitive detection performance compared to existing deep learning models, while offering a more intuitive interpretation. Mingqi Lv, Shengduo Gan, Tieming Chen, Tiantian Zhu 0001, Jinyin Chen |
IET Inf. Secur. | 5 |
| 2025 | ProvADShield: A Multimodel Ensemble Defender Against Adversarial Attacks on Provenance Graph Host Intrusion DetectorabstractHID (host intrusion detection) is a security mechanism for detecting malicious activities performed in a host (e.g., a server, an edge device). Recent research has recast HID as a provenance graph learning problem thanks to the advancement in deep learning techniques, especially the GNNs (graph neural networks). Although the provenance graph learning based HID methods show promise, they are vulnerable to adversarial attacks, where the attackers can bypass the HID models by carefully modifying their attack behaviors. In this paper, we reveal that an adversarial sample generated against one HID model may not be necessarily able to attack another HID model, and we further explore the success rate of adversarial attacks between different HID models by evaluating the mutual transferability. Based on the evaluation, we propose ProvADShield, a framework designed to defend against adversarial attacks on provenance graph learning based HID models. The core idea of ProvADShield is to combine multiple HID models by leveraging the mutual transferability. We evaluate ProvADShield based on a provenance dataset collected and made public by our team. The experiment results show that ProvADShield outperforms state‐of‐the‐art defense systems against adversarial attacks. Mingqi Lv, Kehan Qian, Tieming Chen, Tiantian Zhu 0001, Jinyin Chen |
IET Inf. Secur. | 4 |
| 2025 | VulnTrace: Tracking and Detecting Code Vulnerabilities with Historical Commits and Semantic EmbeddingsabstractOpen source software has evolved into a fundamental element of the contemporary information sector; however, security threats within its supply chain are persistently rising. Within the collaborative development framework of open source, the introduction of malicious code can lead to significant security vulnerabilities. Conventional methods for detecting these vulnerabilities, which rely on machine learning, face challenges such as a lack of sufficient datasets, inadequate deep semantic understanding, and limitations to single-vulnerability detection. To address these challenges, we introduce a novel approach named VulnTrace, which analyzes historical records of submissions in open source projects to construct a high-quality dataset of vulnerabilities with accurate labels. VulnTrace employs Word2Vec alongside Abstract Syntax Tree (AST) technologies to capture both the semantic and structural details of code segments and utilizes a Transformer model for precise vulnerability identification, thereby enhancing accuracy and interpretability in detection. Experimental results indicate that VulnTrace achieves approximately 93% accuracy, 95% precision, 83% recall and an F1 score of 88% in vulnerability detection tasks, significantly reducing false positives and demonstrating remarkable robustness. Qijie Song, Jiaobo Jin, Tiantian Zhu 0001, Tieming Chen, Mingqi Lv, Licheng Pan, Jian-Ping Mei |
Int. J. Softw. Eng. Knowl. Eng. | 3 |
| 2025 | GANDACOG: Implicit Mobile User Authentication in Multi Environments With Scarce DataabstractMobile device user authentication technologies have been studied for decades in the context of personal information security. To strike a balance between security, privacy, and usability, authentication methods based on motion sensors have gained widespread attention in recent years. However, these methods still face several challenges, such as the limited training samples, the finite scene coverage, and the high-cost models. Therefore, there is an urgent need to develop more efficient and reliable solutions to enhance the user experience. To address these challenges, we introduce, which offers the following features: 1) It uses a novel data augmentation method (AUTHGANS) to expand the dataset. 2) It employs a differential attention mechanism to reduce noise interference, improve model scene coverage, and simultaneously reduce the model size during the model training phase, and improve the model’s accuracy. 3) It uses a model distillation strategy (AuthFusion), ensuring high accuracy while reducing the model’s computational requirements on devices. Experiments on a dataset with 1,513 users and noise show that achieves high accuracy while requiring less computational power than other state-of-the-art authentication methods. Tiantian Zhu 0001, Tieming Chen, Mingqi Lv, Zhengqiu Weng, Suyu Zhang |
IEEE Internet Things J. | 1 |
| 2025 | ThreatCog: An adaptive and lightweight mobile user authentication system with enhanced motion sensory signals
Tiantian Zhu 0001, Jian-Ping Mei, Xue Leng, Xiangyang Zheng, Zhengqiu Weng |
J. Inf. Secur. Appl. | 2 |
| 2025 | RT-APT: A real-time APT anomaly detection method for large-scale provenance graph
Zhengqiu Weng, Weinuo Zhang, Tiantian Zhu 0001, Zhenhao Dou, Haofei Sun, Zhanxiang Ye, Ye Tian 0027 |
J. Netw. Comput. Appl. | 3 |
| 2025 | Actminer: Applying causality tracking and increment aligning for graph-based threat hunting
Tiantian Zhu 0001, Tieming Chen, Mingqi Lv, Zhengqiu Weng, Guolang Chen |
Knowl. Based Syst. | 2 |
| 2025 | CRUcialG: Reconstruct Integrated Attack Scenario Graphs by Cyber Threat Intelligence ReportsabstractCyber Threat Intelligence (CTI) reports are factual records compiled by security analysts through their observations of threat events or their own practical experience with attacks. In order to utilize CTI reports for attack detection, existing methods have attempted to map the content of reports onto system-level attack provenance graphs to clearly depict attack procedures. However, existing studies on constructing graphs from CTI reports suffer from problems such as weak Natural Language Processing (NLP) capabilities, discrete and fragmented graphs, and insufficient attack semantic representation. Therefore, we propose a system called CRUcialG for the automated reconstruction of Attack Scenario Graphs (ASGs) by CTI reports. First, we use NLP models to extract systematic attack knowledge from CTI reports to form preliminary ASGs. Then, we propose a four-phase attack rationality validation framework from the tactical phase with attack procedure to evaluate the reasonability of ASGs. Finally, we implement the relation repair and phase supplement of ASGs by adopting a serialized graph generation model. We collect a total of 10,607 CTI reports and generate 5,761 complete ASGs. Experimental results on CTI reports from 30 security vendors and DARPA show that the similarity of ASG reconstruction by CRUcialG can reach 84.54%. Compared with SOTA (EXTRACTOR and AttackG), the recall of CRUcialG (extraction of real attack events) can reach 88.13% and 94.46% respectively, which is 40% higher than SOTA on average. The F1-score of attack phase validation is able to reach 90.04%. Wenrui Cheng, Tiantian Zhu 0001, Tieming Chen, Qixuan Yuan, Chun-lin Xiong, Mingqi Lv, Yan Chen 0004 |
IEEE Trans. Dependable Secur. Comput. | 2 |
| 2025 | Nip in the Bud: Forecasting and Interpreting Post- Exploitation Attacks in Real-Time Through Cyber Threat Intelligence ReportsabstractAdvanced Persistent Threat (APT) attacks have caused significant damage worldwide. Various Endpoint Detection and Response (EDR) systems are deployed by enterprises to fight against potential threats. However, EDR suffers from high false positives. In order not to affect normal operations, analysts need to investigate and filter detection results before taking countermeasures, in which heavy manual labor and alarm fatigue cause analysts miss optimal response time, thereby leading to information leakage and destruction. Therefore, we propose Endpoint Forecasting and Interpreting (EFI), a real-time attack forecast and interpretation system, which can automatically predict next move during post-exploitation and explain it in technique-level, then dispatch strategies to EDR for advance reinforcement. First, we use Cyber Threat Intelligence (CTI) reports to extract the attack scene graph (ASG) that can be mapped to low-level system logs to strengthen attack samples. Second, we build a serialized graph forecast model, which is combined with the attack provenance graph (APG) provided by EDR to generate an attack forecast graph (AFG) to predict the next move. Finally, we utilize the attack template graph (ATG) andgraph alignment plus algorithmfor technique-level interpretation to automatically dispatch strategies for EDR to reinforce system in advance. EFI can avoid the impact of existing EDR false positives, and can reduce the attack surface of system without affecting the normal operations. We collect a total of 3,484 CTI reports, generate 1,429 ASGs, label 8,000 sentences, tag 10,451 entities, and construct 256 ATGs. Experimental results on both DARPA Engagement and large scale CTI dataset show that the alignment score between the AFG predicted by EFI and the real attack graph is able to exceed 0.8, the forecast and interpretation precision of EFI can reach 91.8%. Tiantian Zhu 0001, Tieming Chen, Chun-lin Xiong, Wenrui Cheng, Qixuan Yuan, Aohan Zheng, Mingqi Lv, Yan Chen 0004 |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2025 | TAGAPT: Toward Automatic Generation of APT Samples With Provenance-Level GranularityabstractDetecting advanced persistent threats (APTs) at a host via data provenance has emerged as a valuable yet challenging task. Compared with attack rule matching, machine learning approaches offer new perspectives for efficiently detecting attacks by leveraging their inherent ability to autonomously learn from data and adapt to dynamic environments. However, the scarcity of APT samples poses a significant limitation, rendering supervised learning methods that have demonstrated remarkable capabilities in other domains (e.g., malware detection) impractical. Therefore, we propose a system called TAGAPT, which is able to automatically generate numerous APT samples with provenance-level granularity. First, we introduce a deep graph generation model to generalize various graph structures that represent new attack patterns. Second, we propose an attack stage division algorithm to divide each generated graph structure into stage subgraphs. Finally, we design a genetic algorithm to find the optimal attack technique explanation for each subgraph and obtain fully instantiated APT samples. Experimental results demonstrate that TAGAPT can learn from existing attack patterns and generalize to novel attack patterns. Furthermore, the generated APT samples 1) exhibit the ability to help with efficient threat hunting and 2) provide additional assistance to the state-of-the-art (SOTA) attack detection system (Kairos) by filtering out 73% of the observed false positives. We have open-sourced the code and the generated samples to support the development of the security community. Wenrui Cheng, Qixuan Yuan, Tiantian Zhu 0001, Tieming Chen, Aohan Zheng, Chun-lin Xiong, Mingqi Lv, Yan Chen 0004 |
IEEE Trans. Inf. Forensics Secur. | 3 |
| 2025 | Dehydrator: Enhancing Provenance Graph Storage via Hierarchical Encoding and Sequence GenerationabstractAs the scope and impact of cyber threats have expanded, analysts utilize provenance graphs constructed from kernel logs to hunt for threats and investigate attacks. The high frequency of kernel events and the persistence of attacks pose challenges for the efficient storage of provenance graphs. Current approaches can be categorized into two types: pruning-based storage (e.g., LogGC, CPR, and NodeMerge) and encoding-based storage (e.g., DeepZip, SLEUTH, ELISE, and Leonard). However, none of these methods simultaneously satisfy the following three requirements: 1) lossless content, 2) storage efficiency, and 3) query support. To address this gap, we proposeDehydrator, an efficient provenance graph storage system that fulfills all these requirements. For the logs generated by auditing frameworks,Dehydratoruses field mapping encoding to filter field-level redundancy, hierarchical encoding to filter structure-level redundancy, and finally learns a deep neural network to support batch querying. We have conducted evaluations on seven datasets totaling over one billion log entries. Experimental results show thatDehydratorreduces the storage space by 84.55%.Dehydratoris$7.36\times $more efficient than PostgreSQL,$7.16\times $than Neo4j, and$16.17\times $than Leonard (the work most closely related toDehydrator, published at Usenix Security’23). Tiantian Zhu 0001, Tieming Chen, Mingqi Lv |
IEEE Trans. Inf. Forensics Secur. | 2 |
| 2024 | TREC: APT Tactic / Technique Recognition via Few-Shot Provenance Subgraph LearningabstractAPT (Advanced Persistent Threat) with the characteristics of persistence, stealth, and diversity is one of the greatest threats against cyber-infrastructure. As a countermeasure, existing studies leverage provenance graphs to capture the complex relations between system entities in a host for effective APT detection. In addition to detecting single attack events as most existing work does, understanding the tactics / techniques (e.g., Kill-Chain, ATT&CK) applied to organize and accomplish the APT attack campaign is also important for security operations. Existing studies try to manually design a set of rules to map low-level system events to high-level APT tactics / techniques. However, the rule based methods are coarse-grained and lack generalization ability. Thus, they can only recognize APT tactics and have difficulty in identifying APT techniques. They also cannot adapt to mutant behaviors of existing APT tactics / techniques. Mingqi Lv, Hongzhe Gao, Xuebo Qiu, Tieming Chen, Tiantian Zhu 0001, Jinyin Chen, Shouling Ji |
CCS | 5 |
| 2024 | CTIMD: Cyber threat intelligence enhanced malware detection using API call sequences with parameters
Tieming Chen, Huan Zeng, Mingqi Lv, Tiantian Zhu 0001 |
Comput. Secur. | 4 |
| 2024 | MVD-HG: multigranularity smart contract vulnerability detection method based on heterogeneous graphsabstractAbstract Smart contracts have significant losses due to various types of vulnerabilities. However, traditional vulnerability detection methods rely extensively on expert rules, resulting in low detection accuracy and poor adaptability to novel attacks. To address these problems, in this paper, deep learning methods are combined with smart contract vulnerability code detection approaches. Abstract syntax trees (ASTs), which are special isomorphic graph structures, are an important bridge between source code and graph neural networks. By learning the AST, the model can understand the semantics of the source code. Moreover, graph neural networks have an increasing ability to address complex heterogeneous graphs. Therefore, control flow graphs are fused with data flow graphs on the basis of the ASTs to build heterogeneous graphs with richer code semantics. Furthermore, multigranularity analysis of the vulnerability detection results is performed, including coarse-grained contract-level vulnerability detection and fine-grained line-level vulnerability detection. Through this multigranularity detection approach, vulnerabilities in contracts can be identified and analysed more comprehensively, providing a richer perspective and more solutions for vulnerability detection. The experimental results show that the proposed multigranularity vulnerability detection method based on heterogeneous graphs (MVD-HG) improves both the accuracy and range of the detected vulnerability types in contract-level vulnerability detection tasks; moreover, in the line-level vulnerability detection task, the MVD-HG model achieves significant results and addresses the shortcomings of existing methods. In addition, based on code generation methods used in related fields, a data enhancement method based on the source code is developed, which effectively expands the experimental dataset to address the reduced credibility of the results due to insufficient amounts of data. Jingjie Xu, Ting Wang 0004, Mingqi Lv, Tieming Chen, Tiantian Zhu 0001, Baiyang Ji |
Cybersecur. | 5 |
| 2024 | TrapCog: An Anti-Noise, Transferable, and Privacy-Preserving Real-Time Mobile User Authentication System With High AccuracyabstractThe authentication technology of mobile device users has been studied for decades. To balance security, privacy, and usability, motion sensors-based user authentication methods are widely investigated in recent years. However, existing studies meet the problems such as scarcity of training samples, underutilization of data, poor de-noising ability, insufficient transferability, privacy leakage, and low accuracy. To overcome these difficulties, we propose a system, calledTrapCog, with the following capabilities: 1) In the phase of data collection,TrapCogcan eliminate man-made noise (mislabeling) through differential training based on down-sampling. 2) In the model training stage, the siamese neural network with Long Short-Term Memory (LSTM) as the sub-network is used to achieve sufficient coverage of sample patterns and the transferability of the model. 3) In the phase of real-world authentication, the privacy of the user is tremendously protected through end-side model deployment and local authentication. Experimental results on a dataset composed of 1,513 users with real-world noise show thatTrapCoghas high accuracy and strong transferability, which is much better than state-of-the-art studies. Tiantian Zhu 0001, Qiang Liu 0034, Chun-lin Xiong, Zhengqiu Weng, Tieming Chen, Mingqi Lv, Ting Wang 0004, Yan Chen 0004 |
IEEE Trans. Mob. Comput. | 2 |
| 2023 | System-level data management for endpoint advanced persistent threat detection: Issues, challenges and trends
Tieming Chen, Chenbin Zheng, Tiantian Zhu 0001, Chun-lin Xiong, Qixuan Yuan, Wenrui Cheng, Mingqi Lv |
Comput. Secur. | 3 |
| 2023 | APTSHIELD: A Stable, Efficient and Real-Time APT Detection System for Linux HostsabstractAdvanced Persistent Threat (APT) attacks have caused massive financial loss worldwide. Researchers thereby have proposed a series of solutions to detect APT attacks, such as dynamic/static code analysis, traffic detection, sandbox technology, endpoint detection and response (EDR), etc. However, existing defenses are failed to accurately and effectively defend against the current APT attacks that exhibit strong persistent, stealthy, diverse and dynamic characteristics due to the weak data source integrity, large data processing overhead and poor real-time performance in the process of real-world scenarios. To overcome these difficulties, in this paper we propose APTSHIELD, a stable, efficient and real-time APT detection system for Linux hosts. In the aspect of data collection, audit is selected to stably collect kernel data of the operating system so as to carry out a complete portrait of the attack based on comprehensive analysis and comparison of existing logging tools; In the aspect of data processing, redundant semantics skipping and non-viable node pruning are adopted to reduce the amount of data, so as to reduce the overhead of the detection system; In the aspect of attack detection, an APT attack detection framework based on ATT&CK model is designed to carry out real-time attack response and alarm through the transfer and aggregation of labels. Experimental results on both laboratory and Darpa Engagement show that our system can effectively detect web vulnerability attacks, file-less attacks and remote access trojan attacks, and has a low false positive rate, which adds far more value than the existing frontier work. Tiantian Zhu 0001, Jinkai Yu, Chun-lin Xiong, Wenrui Cheng, Qixuan Yuan, Tieming Chen, Jiabo Zhang, Mingqi Lv, Yan Chen 0004, Ting Wang 0004 |
IEEE Trans. Dependable Secur. Comput. | 1 |
| 2022 | Generic, efficient, and effective deobfuscation and semantic-aware attack detection for PowerShell scriptsabstractIn recent years, PowerShell has increasingly been reported as appearing in a variety of cyber attacks. However, because the PowerShell language is dynamic by design and can construct script fragments at different levels, state-of-the-art static analysis based PowerShell attack detection approaches are inherently vulnerable to obfuscations. In this paper, we design the first generic, effective, and lightweight deobfuscation approach for PowerShell scripts. To precisely identify the obfuscated script fragments, we define obfuscation based on the differences in the impacts on the abstract syntax trees of PowerShell scripts and propose a novel emulation-based recovery technology. Furthermore, we design the first semantic-aware PowerShell attack detection system that leverages the classic objective-oriented association mining algorithm and newly identifies 31 semantic signatures. The experimental results on 2342 benign samples and 4141 malicious samples show that our deobfuscation method takes less than 0.5 s on average and increases the similarity between the obfuscated and original scripts from 0.5% to 93.2%. By deploying our deobfuscation method, the attack detection rates for Windows Defender and VirusTotal increase substantially from 0.33% and 2.65% to 78.9% and 94.0%, respectively. Moreover, our detection system outperforms both existing tools with a 96.7% true positive rate and a 0% false positive rate on average. Chun-lin Xiong, Zhenyuan Li, Yan Chen 0004, Tiantian Zhu 0001, Jian Wang 0007 |
Frontiers Inf. Technol. Electron. Eng. | 4 |
| 2022 | Conan: A Practical Real-Time APT Detection System With High Accuracy and EfficiencyabstractAdvanced Persistent Threat (APT) attacks have caused serious security threats and financial losses worldwide. Various real-time detection mechanisms that combine context information and provenance graphs have been proposed to defend against APT attacks. However, existing real-time APT detection mechanisms suffer from accuracy and efficiency issues due to inaccurate detection models and the growing size of provenance graphs. To address the accuracy issue, we propose a novel and accurate APT detection model that removes unnecessary phases and focuses on the remaining ones with improved definitions. To address the efficiency issue, we propose a state-based framework in which events are consumed as streams and each entity is represented in an FSA-like structure without storing historic data. Additionally, we reconstruct attack scenarios by storing just one in a thousand events in a database. Finally, we implement our design, calledConan, on Windows and conduct comprehensive experiments under real-world scenarios to show thatConancan accurately and efficiently detect all attacks within our evaluation. The memory usage and CPU efficiency ofConanremain constant over time (1-10 MB of memory and hundreds of times faster than data generation), makingConana practical design for detecting both known and unknown APT attacks in real-world scenarios. Chun-lin Xiong, Tiantian Zhu 0001, Weihao Dong, Linqi Ruan, Runqing Yang, Yueqiang Cheng, Yan Chen 0004, Xutong Chen |
IEEE Trans. Dependable Secur. Comput. | 2 |
| 2022 | PowerCog: A Practical Method for Recognizing Power Quality Disturbances Accurately in a Noisy EnvironmentabstractCurrently, with the growing applicability of nonlinear electrical devices, power quality disturbances (PQDs) often occur in power systems. Previous works usually extracted statistical features from electrical signals manually and constructed classifiers with traditional machine learning methods for PQD monitoring. Furthermore, noisy tags or unlabeled data (different from noisy signals) are usually ignored in the traditional training stage, and these methods fail to meet the high accuracy and automation demands of real-world scenarios. To overcome the shortcomings of existing methods, this article proposes a practical method called PowerCog for accurately recognizing PQDs in noisy environments. First, an input voltage waveform signal is divided into several intrinsic mode functions by an empirical wavelet transform, and these functions are then aligned into columns to form a matrix. Second, tritraining is utilized for label refactoring to improve the generalization ability of the model in a noisy environment. Then, an optimized convolutional neural network structure combined with principal component analysis is deployed to extract and select the universal features automatically. Finally, a support vector machine classifier is constructed to recognize PQD patterns. Several comparative experiments are performed to verify the effectiveness and accuracy of PowerCog in complex environments. Tiantian Zhu 0001 |
IEEE Trans. Ind. Informatics | 3 |
| 2022 | Private Cell-ID Trajectory Prediction Using Multi-Graph Embedding and Encoder-Decoder NetworkabstractTrajectory prediction for mobile phone users is a cornerstone component to support many higher-level applications in LBSs (Location-Based Services). Most existing methods are designed based on the assumption that the explicit location information of the trajectories is available (e.g., GPS trajectories). However, collecting such kind of trajectories lays a heavy burden on the mobile phones and incurs privacy concerns. In this paper, we study the problem of trajectory prediction based on cell-id trajectories without explicit location information and propose a deep learning framework (called DeepCTP) to solve this problem. Specifically, we use a multi-graph embedding method to learn the latent spatial correlations between cell towers by exploiting handoff patterns. Then, we design a novel spatial-aware loss function for the encoder-decoder network to generate cell-id trajectory predictions. We conducted extensive experiments on real datasets. The experiment results show that DeepCTP outperforms the state-of-the-art cell-id trajectory prediction methods in terms of prediction error. Mingqi Lv, Dajian Zeng, Ling Chen 0001, Tieming Chen, Tiantian Zhu 0001, Shouling Ji |
IEEE Trans. Mob. Comput. | 5 |
| 2022 | EspialCog: General, Efficient and Robust Mobile User Implicit Authentication in Noisy EnvironmentabstractMobile authentication is a fundamental factor in the protection of user’s private resources. In recent years, motion sensor-based biometric authentication has been widely used for privacy-preserving. However, it faces with the problems including low data collection efficiency, insufficient authentication scenario coverage rate, weak de-noising ability, and poor robustness of models, rendering existing methods difficult to meet the security, privacy, and usability requirements jointly in the real-world scenario. To overcome these difficulties, we propose a system calledEspialCog, which is able to 1) collect the sensor data embedded in mobile devices self-adaptively, unobtrusively and efficiently through the evolutionary stable participation game mechanism (ESPGM) with a high scenario coverage rate; 2) minimize noise from collected data by analyzing three types of abnormalities; and 3) authenticate the ownership of mobile devices in real-time by adopting optimized LSTM model with an enhanced stochastic gradient descent (SGD) algorithm. The simulation experiment on 6000 users shows that the efficiency and coverage rates increase dramatically by deploying our ESPGM. Moreover, we conduct experiments on a large-scale real-world noisy dataset with 1513 users and two other small pure real-world datasets. The experimental results show the high accuracy and favorable robustness ofEspialCogin the noisy environment. Tiantian Zhu 0001, Zhengqiu Weng, Qijie Song, Qiang Liu 0034, Yan Chen 0004, Mingqi Lv, Tieming Chen |
IEEE Trans. Mob. Comput. | 1 |
| 2021 | One Cycle Attack: Fool Sensor-Based Personal Gait Authentication With ClusteringabstractGait authentication, especially sensor-based patterns, has been studied by researchers for decades. Nowadays, gait authentication has become an important facet of biometric systems due to the so-called unique characteristics of each user. With the development of various technologies (i.e., hardware, data processing, features extraction, and learning algorithms), the performance of sensor-based authentication methods is gradually improving. But we have found that the vulnerability of most existing methods can be compromised easily. In this paper, we propose a novel attack model, called one cycle attack, to bypass existing gait authentication methods. Firstly, the gait sequence is divided into multiple gait cycles. By adopting the K-mean algorithm, we get the average distance of each feature sample (extracted from the gait cycle) to its closest cluster center, and its result confirms that independent individuals may have similar gait cycles. Secondly, using six state-of-the-art models it was found that the adversarial gait cycle found with the clustering method can bypass the victim’s model rapidly. Furthermore, to improve the accuracy of sensor-based gait authentication methods to fight against attacks, we present a WPD-LSTM (Wavelet Packet Decomposition and Long Short-Term Memory) multi-cycle defense model which considers the contextual contents of the neighboring gait cycles in the gait sequence. Experimental results on two datasets (the largest public sensor-based gait database OU-ISIR and new dataset from our laboratory) show that our attack model can bypass most of the victims’ models within a limited number of attempts. Specifically, we can compromise 20%–80% of users within 5 attempts by utilizing imitation. On the contrary, the success rate of attackers has been greatly mitigated by deploying our multi-cycle defense model. Tiantian Zhu 0001, Qiang Liu 0034, Zi Lin, Yan Chen 0004, Tieming Chen |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2021 | General, Efficient, and Real-Time Data Compaction Strategy for APT Forensic AnalysisabstractThe damage caused by Advanced Persistent Threat (APT) attacks to governments and large enterprises is gradually escalating. Once an attack event is detected, forensic analysis will use the dependencies between system audit logs to rapidly locate intrusion points and determine the impact of the attacks. Due to the high persistence of APT attacks, huge amounts of data will be stored to meet the needs of forensic analysis, which not only brings great storage overhead, but also sharply increases the computing costs. To compact data without affecting forensic analysis, several methods have been proposed. However, in real-world scenarios, we meet the problems of weak cross-platform capability, large data processing overhead, and poor real-time performance, rendering existing data compaction methods difficult to meet the usability and universality requirements jointly. To overcome these difficulties, this paper proposes a general, efficient, and real-time data compaction method at the system log level; it does not involve internal analysis of the program or depend on the specific operating system type, and it includes two strategies: 1) data compaction of maintaining global semantics (GS), which determines and deletes redundant events that do not affect global dependencies, and 2) data compaction based on suspicious semantics (SS). Given that the purpose of forensic analysis is to restore the attack chain, SS performs context analysis on the remaining events from GS and further deletes the parts that are not related to the attack. The results of the real-world experiments show that the compaction ratios of our method to system events are as high as$4.36\times $to$13.18\times $and$7.86\times $to$26.99\times $on GS and SS, respectively, which is better than state-of-the-art studies. Tiantian Zhu 0001, Linqi Ruan, Chun-lin Xiong, Jinkai Yu, Yaosheng Li, Yan Chen 0004, Mingqi Lv, Tieming Chen |
IEEE Trans. Inf. Forensics Secur. | 1 |
| 2021 | Temporal Multi-Graph Convolutional Network for Traffic Flow PredictionabstractTraffic flow prediction plays an important role in ITS (Intelligent Transportation System). This task is challenging due to the complex spatial and temporal correlations (e.g., the constraints of road network and the law of dynamic change with time). Existing work tried to solve this problem by exploiting a variety of spatiotemporal models. However, we observe that more semantic pair-wise correlations among possibly distant roads are also critical for traffic flow prediction. To jointly model the spatial, temporal, semantic correlations with various global features in the road network, this paper proposes T-MGCN (Temporal Multi-Graph Convolutional Network), a deep learning framework for traffic flow prediction. First, we identify several kinds of semantic correlations, and encode the non-Euclidean spatial correlations and heterogeneous semantic correlations among roads into multiple graphs. These correlations are then modeled by a multi-graph convolutional network. Second, a recurrent neural network is utilized to learn dynamic patterns of traffic flow to capture the temporal correlations. Third, a fully connected neural network is utilized to fuse the spatiotemporal correlations with global features. We evaluate T-MGCN on two real-world traffic datasets and observe improvement by approximately 3% to 6% as compared to the state-of-the-art baseline. Mingqi Lv, Zhaoxiong Hong, Ling Chen 0001, Tieming Chen, Tiantian Zhu 0001, Shouling Ji |
IEEE Trans. Intell. Transp. Syst. | 5 |
| 2020 | WebSmell: An Efficient Malicious HTTP Traffic Detection Framework Using Data Augmentation
Tieming Chen, Zhengqiu Weng, YunPeng Chen, Chenqiang Jin, Mingqi Lv, Tiantian Zhu 0001, Jianhong Lin |
Inscrypt | 6 |
| 2020 | RiskCog: Unobtrusive Real-Time User Authentication on Mobile Devices in the WildabstractRecent hardware advances have led to the development and consumerization of mobile devices, which mainly include smartphones and various wearable devices. To protect the privacy of users, various user authentication mechanisms have been proposed. In particular, biometrics has been widely used for multi-factor authentication. However, biometrics-based authentication mechanisms usually require costly sensors deployed on devices, and rely on explicit user input and Internet connection for performing user authentication. In this article, we propose a system, called RISKCOG, which can authenticate the ownership of mobile devices unobtrusively and in a real-time manner by adopting a learning-based approach. Unlike previous studies on user authentication, for cross-platform deployment, maximum user privacy protection, and unobtrusive authentication, RISKCOG only relies on those widely available and privacy-insensitive motion sensors to capture the data related to the users' daily device usage. It requires no users' explicit input and has no requirement on the users' motion state or the device placement. RISKCOG is also usable in the environment without Internet access by performing offline user identity verification. We conduct comprehensive experiments on smartphones and smartwatches, which show that RISKCOG can authenticate device users rapidly and with high accuracy. Tiantian Zhu 0001, Zhengyang Qu, Haitao Xu 0002, Jingsi Zhang, Zhengyue Shao, Yan Chen 0004, Sandeep Prabhakar |
IEEE Trans. Mob. Comput. | 1 |
| 2019 | Effective and Light-Weight Deobfuscation and Semantic-Aware Attack Detection for PowerShell ScriptsabstractIn recent years, PowerShell is increasingly reported to appear in a variety of cyber attacks ranging from advanced persistent threat, ransomware, phishing emails, cryptojacking, financial threats, to fileless attacks. However, since the PowerShell language is dynamic by design and can construct script pieces at different levels, state-of-the-art static analysis based PowerShell attack detection approaches are inherently vulnerable to obfuscations. To overcome this challenge, in this paper we design the first effective and light-weight deobfuscation approach for PowerShell scripts. To address the challenge in precisely identifying the recoverable script pieces, we design a novel subtree-based deobfuscation method that performs obfuscation detection and emulation-based recovery at the level of subtrees in the abstract syntax tree of PowerShell scripts. Building upon the new deobfuscation method, we are able to further design the first semantic-aware PowerShell attack detection system. To enable semantic-based detection, we leverage the classic objective-oriented association mining algorithm and newly identify 31 semantic signatures for PowerShell attacks. We perform an evaluation on a collection of 2342 benign samples and 4141 malicious samples, and find that our deobfuscation method takes less than 0.5 seconds on average and meanwhile increases the similarity between the obfuscated and original scripts from only 0.5% to around 80%, which is thus both effective and light-weight. In addition, with our deobfuscation applied, the attack detection rates for Windows Defender and VirusTotal increase substantially from 0.3% and 2.65% to 75.0% and 90.0%, respectively. Furthermore, when our deobfuscation is applied, our semantic-aware attack detection system outperforms both Windows Defender and VirusTotal with a 92.3% true positive rate and a 0% false positive rate on average. Zhenyuan Li, Qi Alfred Chen, Chun-lin Xiong, Yan Chen 0004, Tiantian Zhu 0001 |
CCS | 5 |
| 2016 | Beating the Artificial Chaos: Fighting OSN Spam Using Its Own TemplatesabstractOnline social networks (OSNs) are extremely popular among Internet users. However, spam originating from friends and acquaintances not only reduces the joy of Internet surfing but also causes damage to less security-savvy users. Prior countermeasures combat OSN spam from different angles. Due to the diversity of spam, there is hardly any existing method that can independently detect the majority or most of OSN spam. In this paper, we empirically analyze the textual pattern of a large collection of OSN spam. An inspiring finding is that the majority (e.g., 76.4% in 2015) of the collected spam is generated with underlying templates. Based on the analysis, we propose tangram, an OSN spam filtering system that performs online inspection on the stream of user-generated messages. Tangram extracts the templates of spam detected by existing methods and then matching messages against the templates toward the accurate and the fast spam detection. It automatically divides the OSN spam into segments and uses the segments to construct templates to filter future spam. Experimental results on Twitter and Facebook data sets show that tangram is highly accurate and can rapidly generate templates to throttle newly emerged campaigns. Furthermore, we analyze the behavior of detected OSN spammers. We find a series of spammer properties-such as spamming accounts are created in bursts and a single active organization orchestrates more spam than all other spammers combined-that promise more comprehensive spam countermeasures. Tiantian Zhu 0001, Yi Yang 0042, Kai Bu, Yan Chen 0004, Doug Downey, Kathy Lee, Alok N. Choudhary |
IEEE/ACM Trans. Netw. | 1 |
| 2014 | AutoCog: Measuring the Description-to-permission Fidelity in Android ApplicationsabstractThe booming popularity of smartphones is partly a result of application markets where users can easily download wide range of third-party applications. However, due to the open nature of markets, especially on Android, there have been several privacy and security concerns with these applications. On Google Play, as with most other markets, users have direct access to natural-language descriptions of those applications, which give an intuitive idea of the functionality including the security-related information of those applications. Google Play also provides the permissions requested by applications to access security and privacy-sensitive APIs on the devices. Users may use such a list to evaluate the risks of using these applications. To best assist the end users, the descriptions should reflect the need for permissions, which we term description-to-permission fidelity. In this paper, we present a system AutoCog to automatically assess description-to-permission fidelity of applications. AutoCog employs state-of-the-art techniques in natural language processing and our own learning-based algorithm to relate description with permissions. In our evaluation, AutoCog outperforms other related work on both performance of detection and ability of generalization over various permissions by a large extent. On an evaluation of eleven permissions, we achieve an average precision of 92.6% and an average recall of 92.0%. Our large-scale measurements over 45,811 applications demonstrate the severity of the problem of low description-to-permission fidelity. AutoCog helps bridge the long-lasting usability gap between security techniques and average users. Zhengyang Qu, Vaibhav Rastogi, Yan Chen 0004, Tiantian Zhu 0001 |
CCS | 5 |