PANTS:针对 ML 驱动的网络分类器的实用对抗性网络流量样本

Minhao Jin, Maria Apostolaki
{"title":"PANTS:针对 ML 驱动的网络分类器的实用对抗性网络流量样本","authors":"Minhao Jin, Maria Apostolaki","doi":"arxiv-2409.04691","DOIUrl":null,"url":null,"abstract":"Multiple network management tasks, from resource allocation to intrusion\ndetection, rely on some form of ML-based network-traffic classification (MNC).\nDespite their potential, MNCs are vulnerable to adversarial inputs, which can\nlead to outages, poor decision-making, and security violations, among other\nissues. The goal of this paper is to help network operators assess and enhance the\nrobustness of their MNC against adversarial inputs. The most critical step for\nthis is generating inputs that can fool the MNC while being realizable under\nvarious threat models. Compared to other ML models, finding adversarial inputs\nagainst MNCs is more challenging due to the existence of non-differentiable\ncomponents e.g., traffic engineering and the need to constrain inputs to\npreserve semantics and ensure reliability. These factors prevent the direct use\nof well-established gradient-based methods developed in adversarial ML (AML). To address these challenges, we introduce PANTS, a practical white-box\nframework that uniquely integrates AML techniques with Satisfiability Modulo\nTheories (SMT) solvers to generate adversarial inputs for MNCs. We also embed\nPANTS into an iterative adversarial training process that enhances the\nrobustness of MNCs against adversarial inputs. PANTS is 70% and 2x more likely\nin median to find adversarial inputs against target MNCs compared to two\nstate-of-the-art baselines, namely Amoeba and BAP. Integrating PANTS into the\nadversarial training process enhances the robustness of the target MNCs by\n52.7% without sacrificing their accuracy. Critically, these PANTS-robustified\nMNCs are more robust than their vanilla counterparts against distinct\nattack-generation methodologies.","PeriodicalId":501280,"journal":{"name":"arXiv - CS - Networking and Internet Architecture","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PANTS: Practical Adversarial Network Traffic Samples against ML-powered Networking Classifiers\",\"authors\":\"Minhao Jin, Maria Apostolaki\",\"doi\":\"arxiv-2409.04691\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiple network management tasks, from resource allocation to intrusion\\ndetection, rely on some form of ML-based network-traffic classification (MNC).\\nDespite their potential, MNCs are vulnerable to adversarial inputs, which can\\nlead to outages, poor decision-making, and security violations, among other\\nissues. The goal of this paper is to help network operators assess and enhance the\\nrobustness of their MNC against adversarial inputs. The most critical step for\\nthis is generating inputs that can fool the MNC while being realizable under\\nvarious threat models. Compared to other ML models, finding adversarial inputs\\nagainst MNCs is more challenging due to the existence of non-differentiable\\ncomponents e.g., traffic engineering and the need to constrain inputs to\\npreserve semantics and ensure reliability. These factors prevent the direct use\\nof well-established gradient-based methods developed in adversarial ML (AML). To address these challenges, we introduce PANTS, a practical white-box\\nframework that uniquely integrates AML techniques with Satisfiability Modulo\\nTheories (SMT) solvers to generate adversarial inputs for MNCs. We also embed\\nPANTS into an iterative adversarial training process that enhances the\\nrobustness of MNCs against adversarial inputs. PANTS is 70% and 2x more likely\\nin median to find adversarial inputs against target MNCs compared to two\\nstate-of-the-art baselines, namely Amoeba and BAP. Integrating PANTS into the\\nadversarial training process enhances the robustness of the target MNCs by\\n52.7% without sacrificing their accuracy. Critically, these PANTS-robustified\\nMNCs are more robust than their vanilla counterparts against distinct\\nattack-generation methodologies.\",\"PeriodicalId\":501280,\"journal\":{\"name\":\"arXiv - CS - Networking and Internet Architecture\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Networking and Internet Architecture\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.04691\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Networking and Internet Architecture","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.04691","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

从资源分配到入侵检测等多项网络管理任务都依赖于某种形式的基于 ML 的网络流量分类 (MNC)。尽管 MNC 潜力巨大,但仍容易受到对抗性输入的影响,从而导致中断、决策失误和安全违规等问题。本文的目标是帮助网络运营商评估和增强其 MNC 的稳健性,以抵御对抗性输入。其中最关键的一步是生成能骗过 MNC 的输入,同时又能实现不可靠的威胁模型。与其他 ML 模型相比,寻找针对 MNC 的对抗性输入更具挑战性,因为存在不可区分的组件(如流量工程),而且需要限制输入以保留语义并确保可靠性。这些因素阻碍了直接使用在对抗性 ML(AML)中开发的成熟的基于梯度的方法。为了应对这些挑战,我们引入了 PANTS,这是一个实用的白盒框架,它将 AML 技术与满意度模态理论(SMT)求解器独特地整合在一起,为跨国公司生成对抗性输入。我们还将 PANTS 嵌入到迭代对抗训练过程中,以提高跨国公司对抗对抗输入的稳健性。与 Amoeba 和 BAP 这两种最先进的基线相比,PANTS 找到针对目标 MNC 的对抗性输入的可能性中位数分别提高了 70% 和 2 倍。将 PANTS 集成到对抗训练过程中,可将目标 MNC 的鲁棒性提高 52.7%,而不会降低其准确性。更重要的是,这些经过 PANTS 改进的 MNCs 在面对不同的攻击生成方法时,比其虚构的同类产品更具鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PANTS: Practical Adversarial Network Traffic Samples against ML-powered Networking Classifiers
Multiple network management tasks, from resource allocation to intrusion detection, rely on some form of ML-based network-traffic classification (MNC). Despite their potential, MNCs are vulnerable to adversarial inputs, which can lead to outages, poor decision-making, and security violations, among other issues. The goal of this paper is to help network operators assess and enhance the robustness of their MNC against adversarial inputs. The most critical step for this is generating inputs that can fool the MNC while being realizable under various threat models. Compared to other ML models, finding adversarial inputs against MNCs is more challenging due to the existence of non-differentiable components e.g., traffic engineering and the need to constrain inputs to preserve semantics and ensure reliability. These factors prevent the direct use of well-established gradient-based methods developed in adversarial ML (AML). To address these challenges, we introduce PANTS, a practical white-box framework that uniquely integrates AML techniques with Satisfiability Modulo Theories (SMT) solvers to generate adversarial inputs for MNCs. We also embed PANTS into an iterative adversarial training process that enhances the robustness of MNCs against adversarial inputs. PANTS is 70% and 2x more likely in median to find adversarial inputs against target MNCs compared to two state-of-the-art baselines, namely Amoeba and BAP. Integrating PANTS into the adversarial training process enhances the robustness of the target MNCs by 52.7% without sacrificing their accuracy. Critically, these PANTS-robustified MNCs are more robust than their vanilla counterparts against distinct attack-generation methodologies.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信