Traffic-Aware Randomized Smoothing for LLM-Based Network Intrusion Detection
Not on the map. Why?
Abstract (arXiv)
Large language model (LLM)-based intrusion detection systems (IDS) are increasingly studied for security monitoring, yet their robustness against feasible traffic manipulation remains largely empirical. We present Traffic-Aware Randomized Smoothing (TA-RS), a classifier-agnostic certified defense that injects Gaussian noise exclusively into the directly controllable (DC) subspace -- features a remote attacker can modify -- during both fine-tuning and certification, aligning the smoothing distribution with the attacker-controllable subspace. We identify a critical prerequisite: applying standard randomized smoothing to clean-trained LLM-IDS yields weak certified accuracy in three of four (model, dataset) pairs tested (14-33%, at or below random) and only 57% in the fourth (43 pp below the noise-augmented result); noise-augmented fine-tuning recovers to 68-100% on two of three benchmark datasets (at sigma=0.25). At the L_inf-equivalent threshold R_inf = epsilon*sqrt(|DC|) (epsilon=0.05), TA-RS achieves 55-100% certified accuracy on CIC-IDS-2018 and HIKARI-2021, with median certified radii (R approx 0.45-0.96) exceeding R_inf by 1.8-5x (across sigma=0.25-1.00). Against a fairly trained iso-trained RS baseline the residual advantage is dataset-dependent (4-19 pp on CIC-IDS-2018). The larger gap -- up to 72 pp against an isotropic RS baseline that shares the DC-noise-augmented training recipe -- primarily reflects the training-certification mismatch rather than DC alignment alone: isotropic test-time noise perturbs uncontrollable features the attacker cannot exploit, triggering abstention rates up to 68%. RT-IoT2022 probes the limits of the method: it fails under the default fine-tuning recipe but recovers to 76%/69% certified accuracy (LLaMA3-8B/Qwen3-8B) when noise augmentation is increased.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 22 of its 30 references that are in the map. First posted on arXiv 15 Jul 2026.
Builds on
22 of 30 references.
References · 22
- 2014Explaining and Harnessing Adversarial Examplescited by 7,364
- 2017Towards Deep Learning Models Resistant to Adversarial Attackscited by 6,415
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2016Towards Evaluating the Robustness of Neural Networkscited by 2,998
- 2019Certified Adversarial Robustness via Randomized Smoothingcited by 1,340
- 2017Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networkscited by 744
- 2017Evasion Attacks against Machine Learning at Test Timecited by 689
- 2018Certified Robustness to Adversarial Examples with Differential Privacycited by 468
- 2018Efficient Neural Network Robustness Certification with General Activation Functionscited by 445
- 2019Provably Robust Deep Learning via Adversarially Trained Smoothed Classifierscited by 330
- 2020Randomized Smoothing of All Shapes and Sizescited by 147
- 2020MACER: Attack-free and Scalable Robust Training via Maximizing Certified Radiuscited by 114
10 more
- 2020(De)Randomized Smoothing for Certifiable Defense against Patch Attackscited by 98
- 2020Curse of Dimensionality on Randomized Smoothing for Certifiable Robustnesscited by 56
- 2023ChatGPT for Vulnerability Detection, Classification, and Repair: How Far Are We?cited by 44
- 2020Evaluating and Improving Adversarial Robustness of Machine Learning-Based Network Intrusion Detectorscited by 26
- 2022The Role of Machine Learning in Cybersecuritycited by 22
- 2024SEvenLLM: Benchmarking, Eliciting, and Enhancing Abilities of Large Language Models in Cyber Threat Intelligencecited by 22
- 2023Log Parsing: How Far Can ChatGPT Go?cited by 16
- 2019Intriguing Properties of Adversarial ML Attacks in the Problem Space [Extended Version]cited by 7
- 2022Certified Adversarial Robustness via Anisotropic Randomized Smoothingcited by 6
- 2026Controllability-Aware Adversarial Examples Against LLM-Based Network Traffic Classifierscited by 1
Built on by
Not cited yet.