首页|期刊导航|计算机科学与探索|面向网络流量特征智能混淆的通用补丁构造方法

面向网络流量特征智能混淆的通用补丁构造方法OA

Universal Patch Construction Method for Intelligent Obfuscation of Network Traffic Features

中文摘要英文摘要

基于深度学习的加密网络流量识别技术可能导致网络敏感信息的泄露,现有的对抗样本防御方案普遍面临带宽开销高、黑盒场景适应性差以及防御方法通用性差等问题.为此,提出了一种面向网络流量特征智能混淆的通用补丁构造方法UPCM,基于特征可逆的流量表征图,构建了离线式、通用且无定向的对抗补丁生成框架,在特征层面以及数据包层面混淆流量,并设计了高斯噪声驱动的自适应扰动策略,支持智能化地混淆网络流量的时序特征.基于真实网络流量数据集的实验表明,UPCM在典型网络流量环境中的防御成功率超过85%,且带宽开销控制在10%以内.此外,UPCM生成的对抗补丁具有较好的通用性和迁移性,仅需一种补丁即可防御整个网络流量,迁移至其他基于时序特征的深度学习模型时,仍能保持约85%的防御成功率.

Deep learning-based encrypted network traffic identification technologies may lead to the leakage of sensitive network information.Existing adversarial sample defense schemes generally face challenges such as high bandwidth over-head,poor adaptability in black-box scenarios,and poor generality of defense methods.To address these issues,this paper proposes a universal patch construction method(UPCM)for intelligent obfuscation of network traffic features,based on a feature-reversible traffic representation graph,to construct an offline,universal,and undirected adversarial patch generation framework for confusing traffic at both the feature level and packet level.A Gaussian noise-driven adaptive perturbation strategy is designed to support intelligent obfuscation of the temporal features of network traffic.Experiments on real-world network traffic datasets show that UPCM achieves a defense success rate of over 85%in typical network traffic en-vironments,with bandwidth overhead controlled within 10%.Furthermore,the adversarial patches generated by UPCM exhibit strong generality and transferability:a single patch can defend against all types of network traffic,and when mi-grated to other deep learning models based on temporal features,the defense success rate remains approximately 85%.

奚宗棠;邢长友;张国敏;王耀辉;康梦琦

陆军工程大学 指挥控制工程学院,南京 210007陆军工程大学 指挥控制工程学院,南京 210007陆军工程大学 指挥控制工程学院,南京 210007陆军工程大学 指挥控制工程学院,南京 210007陆军工程大学 指挥控制工程学院,南京 210007

信息技术与安全科学

流量识别对抗补丁流量混淆深度学习

traffic identificationadversarial patchtraffic obfuscationdeep learning

《计算机科学与探索》 2026 (5)

1365-1379,15

国家自然科学基金面上项目(62172432)江苏省自然科学基金面上项目(BK20242076).This work was supported by the National Natural Science Foundation of China(62172432),and the Natural Science Foundation of Jiangsu Province(BK20242076).

10.3778/j.issn.1673-9418.2506007

评论