用大模型生成的恶意脚本行为数据,自动识别网站后门家族,提升安全响应速度。
Beyond Detection: A Comprehensive Benchmark and Study on Representation Learning for Fine-Grained Webshell Family Classification
- 通过动态调用轨迹提取行为特征,抗加密混淆
- 用大模型合成新变种扩充数据集,提升分类鲁棒性
- 首次系统评测多种表示学习方法,适合安全研究员参考
恶意网站后门对医疗、金融等关键数字基础设施构成持续威胁。尽管检测技术已有进展,但现有研究多停留在区分恶意与正常样本,难以深入分析攻击者策略。本文提出自动化网站后门家族分类的新方向,旨在识别具体恶意软件谱系以支持精准防御。为此,我们首次构建系统性研究框架:从真实后门提取动态函数调用轨迹,利用大语言模型生成新变种增强数据多样性,并将轨迹抽象为序列、图和树结构。在四个真实标注的数据集上,评估了包括CBOW、GloVe、BERT、SimCSE、Graph Kernels、Graph Edit Distance、Graph2Vec及多种图神经网络在内的多种表示学习方法。实验覆盖监督与无监督设置,建立基准并揭示有效组合模式,为后续主动防御提供可复现的技术路径。
原文摘要 · Abstract (English)
Malicious WebShells pose a significant and evolving threat by compromising critical digital infrastructures and endangering public services in sectors such as healthcare and finance. While the research community has made significant progress in WebShell detection (i.e., distinguishing malicious samples from benign ones), we argue that it is time to transition from passive detection to in-depth analysis and proactive defense. One promising direction is the automation of WebShell family classification, which involves identifying the specific malware lineage in order to understand an adversary's tactics and enable a precise, rapid response. This crucial task, however, remains a largely unexplored area that currently relies on slow, manual expert analysis. To address this gap, we present the first systematic study to automate WebShell family classification. Our method begins with extracting dynamic function call traces to capture inherent behaviors that are resistant to common encryption and obfuscation. To enhance the scale and diversity of our dataset for a more stable evaluation, we augment these real-world traces with new variants synthesized by Large Language Models. These augmented traces are then abstracted into sequences, graphs, and trees, providing a foundation to benchmark a comprehensive suite of representation methods. Our evaluation spans classic sequence-based embeddings (CBOW, GloVe), transformers (BERT, SimCSE), and a range of structure-aware algorithms, including Graph Kernels, Graph Edit Distance, Graph2Vec, and various Graph Neural Networks. Through extensive experiments on four real-world, family-annotated datasets under both supervised and unsupervised settings, we establish a robust baseline and provide practical insights into the most effective combinations of data abstractions, representation models, and learning paradigms for this challenge.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。