AI Permission: From Session Layer to Kernel Layer

Jack

When an AI agent runs in a production environment with authorized credentials — database

passwords, API tokens, cloud keys — every sub-agent it spawns and every script it executes inherits

those credentials. The authorized token becomes the attack surface: a hallucinated command or

prompt-injection can drop a production database, purge cloud storage, or mass-delete email before any

human can intervene. Real incidents of this kind are documented in this paper. Current AI permission

systems operate at the session layer and are blind to operations that bypass the session: direct library

calls, fresh sub-agents, and background processes all carry live credentials without passing through

any permission interceptor. We introduce the Kernel-Level AI Isolation Layer (KAIL), enforcing AI

permission policy at the syscall and network level below any session boundary. We present AI

Guardian, a Linux eBPF implementation of KAIL that intercepts destructive operations defeating

session-layer controls, providing reliable protection for production data in AI agent deployments.

Reviewer's Comments

Reviewer's Comments

Arrow
Arrow
Arrow

AI Guardian / KAIL tackles an important and timely problem: autonomous AI agents with live credentials can cause irreversible damage faster than humans can react, and session-layer controls are fundamentally bypassable because they operate in the same context as the agent. The three exploits against Claude Code's auto mode (using `psycopg2`, `urllib` with a sub-agent, and `rm` via a fresh sub-agent) convincingly demonstrate that the weakness is architectural rather than a missing rule. The Layer 1–5 model, hardware-wallet analogy, and eBPF-based implementation provide a practical and well-executed defense.

A few improvements would strengthen the paper. First, broaden the evaluation beyond the three exploits by testing additional database drivers, HTTP clients, and deeper sub-agent chains to show the bypasses generalize. Second, include performance metrics such as latency, false positives, and the impact of freezing processes during active operations. Finally, demonstrating protection against a realistic end-to-end attack, such as the PocketOS-style database wipe scenario, would provide even stronger validation.

Overall, this is a well-written and compelling paper that makes a meaningful contribution to AI agent security.

A genuinely strong project — real working system, sound threat model, and an approach that addresses a real gap. Unlike many submissions this one actually does what it claims. Main issues:

Document/landing-page contradictions undercut trust. The README says Email Guardian is live and tested; the landing page marks it "PLANNED." The landing page reports "0 Total Intercepts (24h)" yet "100% eBPF Catch Rate" and a live intercept feed — those don't cohere. Pick one source of truth and make the claims consistent.

"100% catch rate" with 0 intercepts and 3 hand-built bypass cases isn't a measured result. It's three anecdotes you constructed, not an evaluation. Run a real suite — N destructive operations across varied vectors (drivers, sub-agents, compiled binaries, shells) — and report catch rate with the denominator. That converts the claim from marketing to evidence.

The threat model has an unaddressed hole. You note a compromised agent can't bypass by killing the guardian (needs root). But the agent runs as uid=1000 and the guardian's own allow rules exempt /tmp/ and ~/.claude/ for claude-code — a rogue agent operating within those paths, or using a syscall you don't hook (e.g. rename/renameat2 to clobber a file rather than unlink, or truncate), evades silently. Enumerate the syscall coverage gaps explicitly.

Live, publicly-reachable infrastructure is a real risk. A root-running eBPF service with a dashboard bound to 0.0.0.0:8080 and a public EC2 hostname in the submission is an exposure liability, not a feature. Note auth/binding posture.

Telegram-in-the-loop has a latency/availability failure mode — 1800s auto-deny is a long freeze, and a network/bot outage stalls every destructive op. Discuss degradation behavior.

This is a compelling and practically important project. The paper identifies a real operational safety gap for AI agents: application/session-layer permission systems can be bypassed by direct library calls, fresh sub-agents, or background processes, while the destructive operation still ultimately reaches the kernel or network stack. The “Kernel-Level AI Isolation Layer” framing is clear, and the AI Guardian prototype makes the argument concrete.

The strongest contribution is the end-to-end demonstration: three bypasses against session-layer controls, followed by a kernel/eBPF implementation that intercepts the same classes of destructive operations. The layer-by-layer permission-stack analysis is also useful because it explains why adding more deny rules is unlikely to be sufficient. The human-in-the-loop approval workflow and audit trail are practical design choices for production agent deployments.

The main improvement would be to strengthen the empirical and reproducibility details. The paper would benefit from clearer experimental logs, exact environment setup, code availability, and quantitative measurements: interception latency, false-positive/false-negative rates, overhead under normal workloads, approval timeout behavior, and how often legitimate operations are blocked. The incident examples are motivating, but some citations appear informal or difficult to verify; stronger sourcing or clearer caveats would improve credibility.

The security model should also be sharpened. Kernel-level enforcement is powerful, but it introduces its own trusted computing base, operational risks, and bypass possibilities: non-OpenSSL TLS stacks, encrypted payloads before the hook point, root-level tampering, process-freeze denial of service, and broad pattern-matching false positives. The paper acknowledges several of these, but the claims that KAIL “catches all” or reduces the surface to a few hook points should be softened unless broader coverage is demonstrated.

Overall, this is a high-impact systems safety prototype with a strong practical thesis. It would be especially valuable with more rigorous benchmarking, broader API coverage, and a clearer comparison to existing endpoint detection/response, policy engines, and sandboxing approaches.

Cite this work

@misc {

title={

(HckPrj) AI Permission: From Session Layer to Kernel Layer

},

author={

Jack

},

date={

},

organization={Apart Research},

note={Research submission to the research sprint hosted by Apart.},

howpublished={https://apartresearch.com}

}

Recent Projects

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

PROTEUS (PROTein Evaluation for Unusual Sequences): Structure-Informed Safety Screening for de novo and Evasion-Prone Protein-Coding Sequences

AI protein design tools like RFdiffusion, ProteinMPNN, and Bindcraft make it trivial to produce low-homology sequences that fold into active, potentially hazardous architectures. However, sequence homology-based biosafety screening tools cannot detect proteins that pose functional risk through structurally novel mechanisms with no sequence precedent. We present a tiered computational pipeline that addresses this gap by combining MMseqs2 sequence alignment with structure-based comparison via FoldSeek and DALI against curated toxin databases totaling ~34,000 entries. AlphaFold2-predicted structures are screened for both global fold similarity (FoldSeek) and local active/allosteric site geometry (DALI), capturing convergent functional hazards that sequence screening misses. The pipeline was validated against a panel of toxins, benign proteins, structural mimics, and de novo-designed Munc13 binders, as well as modified ricin variants with residue substitutions. We additionally tested robustness to partial-synthesis evasion, where a bad actor submits multiple shorter coding sequences intended for downstream reassembly into a full toxin-coding gene. We found that while sequence-based screening did not identify any de novo ricin analogues with high certainty, the combined pipeline with FoldSeek and DALI identified all 24 tested de novo ricins as toxic.

Read More

OliGraph: graph-based screening of large oligopools

Existing synthesis screening tools cannot evaluate short oligonucleotide pools, whose overlapping fragments can be reassembled into regulated sequences via polymerase cycling assembly (PCA) yet fall below gene-length detection thresholds. We present OliGraph, an open-source tool that constructs a bi-directed overlap graph from an oligonucleotide pool and extracts contigs for downstream gene-length screening. An optional PCA mode retains only cross-strand overlaps consistent with PCA chemistry. We validated OliGraph in a blinded study across ten simulated pools (70–9,184 oligonucleotides, 30–300 bp) spanning four risk categories. BLAST screening of individual oligonucleotides failed to identify sequences of concern in most pools: three returned zero hits, and vector noise obscured true positives in the remainder. After OliGraph assembly, contig-level BLAST matched the longest assembled sequences (up to 1,905 bp) to sequences of concern at 97–100% identity. In one pool, assembly collapsed 1,634 individual BLAST results into 10 hits from a single contig, all assigned to the same source organism. PCA mode correctly distinguished assemblable from non-assemblable fragments within the same pool. Two pools with no assemblable structure yielded no contigs. OliGraph processed all pools in under 0.2 seconds, fast enough for real-time order screening and consistent with proposals to bring oligonucleotide orders within the scope of synthesis screening regulation.

Read More

BioRT-Bench: A Multi-Attack Red-Teaming Benchmark for Bio-Misuse Safeguards in Frontier LLMs

Frontier AI laboratories are expected to maintain safeguards against biological misuse, but whether deployed models actually refuse bio-misuse queries under adversarial pressure is largely unmeasured in the public literature. We introduce BioRT-Bench, a benchmark that runs four attack methods (direct request, PAIR, Crescendo, and base64 encoding) against four frontier models (Claude Sonnet 4.6, GPT-5.4, DeepSeek V4-flash, Kimi K2.5) across 40 prompts spanning five biosecurity-relevant categories. Responses are scored by a calibrated judge extending StrongREJECT with two bio-specific dimensions: specificity and actionability. We measure Attack Success Rate (ASR), where 0 means the model fully refused and 1 means it provided specific, actionable bio-misuse content. Our results reveal a sharp robustness divide: Chinese frontier models (DeepSeek, Kimi) have under 5% refusal rates even under direct request (ASR 0.88 and 0.79), while Western models (Claude, GPT) maintain substantially stronger safeguards (ASR 0.15 and 0.16). Crescendo is the most effective attack across all models, both in bypassing refusal and in eliciting actionable content. Claude Sonnet 4.6 is the most robust model tested, achieving 100% refusal against base64-encoded prompts.

Read More

This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.
This work was done during one weekend by research workshop participants and does not represent the work of Apart Research.