跳到正文
arXiv:cs.AI· Sabrine Ennaji, Elhadj Benkhelifa, Nadia Kabachi·· 4 小时前AI 评分37

Phantom State Attack:针对 IIoT 入侵检测的时间同步攻击

Out of Sync, Out of Sight: Phantom State Attacks against IIoT Intrusion Detection

AI 导读

研究者提出 Phantom State Attack(PSA),在被动零查询威胁模型下利用 IDS 时间窗口聚合机制发起攻击。PSA 不修改数据包或特征,而是按攻击流自身的到达间隔变异性注入有界时间漂移,将观测推过最近的窗口边界,使 IDS 重建出偏离真实过程状态的"幻影状态"。

正文

View PDF HTML (experimental)

Abstract:Machine learning-based intrusion detection systems (IDS) are critical for securing Industrial Internet of Things (IIoT) environments. Most adversarial research against them perturbs the feature vector or the traffic that produces it, and depends on gradient access, repeated model queries, or a learned model of benign traffic. A smaller line of work reshapes packet timing without querying the detector, but makes malicious traffic mimic a learned model of benign timing. Across these approaches, one assumption of industrial monitoring pipelines has received little attention: temporal synchronization. An IDS reconstructs operational state by aggregating telemetry into sliding or tumbling windows, so its view depends not only on what is observed but on when each observation falls relative to a window boundary.
We introduce the Phantom State Attack (PSA), which exploits that dependence under a passive, zero-query threat model. Rather than modifying packets, perturbing features, querying the classifier, or fitting any model of benign traffic, PSA injects bounded timing drift calibrated to the attack flow's own inter-arrival variability, moving observations across the nearest window boundary by the minimal shift needed. The IDS then reconstructs a phantom state that diverges from the true process state.
We evaluate PSA on ToN-IoT and CIC IIoT 2025 (DataSense), against Random Forest, MLP and XGBoost, measuring detection degradation, synchronization distortion, stealth, and attacker cost. PSA degrades detection on flows carrying enough packets for window-boundary redistribution, and leaves others almost unchanged, so its effect is conditional. A query-based baseline reaches higher raw success but needs many queries per window, while PSA needs none. The results identify temporal aggregation as an attack surface reachable under weaker assumptions than prior evasion techniques.
Subjects: Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI)
Cite as: arXiv:2610.02552 [cs.CR]
  (or arXiv:2610.02552v1 [cs.CR] for this version)
  https://doi.org/10.48550/arXiv.2610.02552

arXiv-issued DOI via DataCite (pending registration)

Submission history

From: Sabrine Ennaji [view email]
[v1] Thu, 1 Oct 2026 22:36:34 UTC (2,872 KB)

来源:arXiv:cs.AI · arxiv.org