SoK:时间戳不等于时间模型——重新思考基于主机的入侵检测中的时间推理
SoK: Timestamps Are Not a Time Model: Rethinking Temporal Reasoning in Host-Based Intrusion Detection
AI 导读
这篇系统性知识梳理(SoK)论文指出,基于主机的入侵检测系统依赖时间戳排序、划分窗口和串联攻击阶段,但大多数时钟、传递、实体身份和证据完整性假设未被明确陈述。作者提炼出时间模型的五个组件和证据假设清单,审查了15类检测研究、11种时间知识表示与推理形式化方法,发现28/38篇基于溯源的检测论文信任捕获或存储证据,且无一说明哪些结论能在记录被删除、延迟或伪造后仍然成立。论文最后提出五个开放挑战。
正文 · 原文
Abstract:Host-based intrusion detectors order events, window audit streams and sequence attack stages by their timestamps. Every conclusion they draw therefore rests on assumptions about clocks, delivery, entity identity and the integrity of the evidence, and most of these assumptions go unstated. This Systematization of Knowledge (SoK) makes them explicit. Drawing on temporal databases, stream processing and runtime verification, we distill five components of a time model, together with a checklist of evidence assumptions and four levels of guarantee, and walk through a running campaign with them. A documented search yields fifteen families of detection and investigation. For papers selected by screening role and period, plus named systems and landmarks, we check the stated assumptions in the full texts, and we assess eleven temporal knowledge representation and reasoning (KRR) formalisms and a learned baseline on nine attack patterns. Some early alert correlators stated clock and delivery assumptions, and forensics measures clock error. Current provenance-based detectors state no clock bound. Four audited papers describe input-ordering conditions or conventions, but none specifies conditions for conclusion validity across a stated class of delivery failures. In the selected provenance-based systems, campaign composition uses system-specific procedures or objectives, learned state, causal graph queries or language models, and beyond CEP-based query systems, we found no temporal rule language or stream reasoner from KRR applied to host audit data. In 28 of 38 audited provenance-era detector papers, capture or stored evidence is trusted or its manipulation is placed out of scope, and none says which conclusions survive deleted, delayed or forged records. Five open challenges follow from these gaps.
| Comments: | Extended version with full appendices (search method, KRR domain analysis, rating evidence, formalizations). 51 pages, 1 figure, 16 tables. Artifacts: doi:https://doi.org/10.5281/zenodo.23530002 |
| Subjects: | Cryptography and Security (cs.CR); Artificial Intelligence (cs.AI); Logic in Computer Science (cs.LO) |
| Cite as: | arXiv:2610.35151 [cs.CR] |
| (or arXiv:2610.35151v1 [cs.CR] for this version) | |
| https://doi.org/10.48550/arXiv.2610.35151 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Markus Nissl [view email]
[v1]
Mon, 26 Oct 2026 10:16:56 UTC (174 KB)
来源:arXiv cs.AI · arxiv.org