RS-2026-092 The Data Layer is the Blind Spot: Empirical Bypasses of Kernel-Level Runtime Enforcement

Kernel-level enforcement mechanisms — BPF LSM, eBPF, in-memory attestation — are the current state of the art for securing high-assurance AI workloads. The core assumption of these systems is that if you verify the binary and enforce the syscall, the execution is secure. This paper presents empirical evidence that this assumption is structurally flawed.We demonstrate three distinct attack classes — memory poisoning, knowledge-base poisoning, and hallucination-based supply-chain injection — that operate entirely through legitimate, authorized syscalls. In every case, the enforcement layer observes a signed, verified binary performing its normal function. The attack is in the data the binary processes, not the execution path it takes. This finding establishes a hard boundary between execution-layer controls and data-layer truth, and argues that any durable enforcement mechanism must bind intent to an out-of-band root of trust rather than relying on the integrity of the data the agent reasons over.All findings are reproducible. Each attack class is accompanied by a cryptographically signed evidence chain (Ed25519 + ML-DSA-65, SHA-256 Merkle tree) produced by the SPECTER HALLUBOT, SPECTER SHELL, and SPECTER EMBEDDED toolchain. Chain integrity was verified in each case.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-05
DOI
https://doi.org/10.5281/zenodo.23986662
Primary Topic
Security and Verification in Computing
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

RS-2026-092 The Data Layer is the Blind Spot: Empirical Bypasses of Kernel-Level Runtime Enforcement

Richard Barron
Zenodo (CERN European Organization for Nuclear Research)
Security and Verification in Computing
preprint

RS-2026-092 The Data Layer is the Blind Spot: Empirical Bypasses of Kernel-Level Runtime Enforcement

Richard Barron
preprint en

Abstract

Kernel-level enforcement mechanisms — BPF LSM, eBPF, in-memory attestation — are the current state of the art for securing high-assurance AI workloads. The core assumption of these systems is that if you verify the binary and enforce the syscall, the execution is secure. This paper presents empirical evidence that this assumption is structurally flawed.We demonstrate three distinct attack classes — memory poisoning, knowledge-base poisoning, and hallucination-based supply-chain injection — that operate entirely through legitimate, authorized syscalls. In every case, the enforcement layer observes a signed, verified binary performing its normal function. The attack is in the data the binary processes, not the execution path it takes. This finding establishes a hard boundary between execution-layer controls and data-layer truth, and argues that any durable enforcement mechanism must bind intent to an out-of-band root of trust rather than relying on the integrity of the data the agent reasons over.All findings are reproducible. Each attack class is accompanied by a cryptographically signed evidence chain (Ed25519 + ML-DSA-65, SHA-256 Merkle tree) produced by the SPECTER HALLUBOT, SPECTER SHELL, and SPECTER EMBEDDED toolchain. Chain integrity was verified in each case.

Zenodo (CERN European Organization for Nuclear Research)
Security and Verification in Computing
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon