Skip to content
Preprint

A Bayesian Correlated Equilibrium for Early Insider-Threat Detection

Sep 2026 · 0 citations · 25 references
Computer Science

TL;DR

This work proves three guarantees: (1) calibrated intervention losses make recommended behavior a current-self best response despite behavioral biases, (2) controlled evidence accumulation guarantees intervention in bounded expected time before exfiltration, and (3) median aggregation confines implemented actions to the honest recommendation range when fewer than half of certifiers are Byzantine.

Abstract

We model insider threat detection as a dynamic Bayesian game in which a platform coordinates a committee of strategic certifiers to sustain equilibrium among honest users and detect malicious deviations before exfiltration. Certifiers and users operate under a Bayesian Temporal Correlated Equilibrium (BTCE), where a sealed-envelope correlating device issues private recommendations over time and obedience is verified at every on-path information state. Unlike Stackelberg formulations, BTCE coordinates heterogeneous certifiers without requiring commitment power. We incorporate present bias and loss aversion to capture impulsive escalation dynamics, enabling 1.7--4.5 days earlier detection than rational baselines. We prove three guarantees: (1) calibrated intervention losses make recommended behavior a current-self best response despite behavioral biases, (2) controlled evidence accumulation guarantees intervention in bounded expected time before exfiltration, and (3) median aggregation confines implemented actions to the honest recommendation range when fewer than half of certifiers are Byzantine. On CERT r6.2 our mechanism achieves up to 28.3% pre-exfiltration detection with false positives below 1.6%, while both a transformer baseline and a streaming provenance approximation (HOLMESLite) achieve near-zero pre-exfiltration detection under comparable constraints.

View source

Similar papers

Open access Aug 2026

Simulation-Informed Bayesian Stackelberg Defense for Multi-Stage Cyber Attacks

A five-stage Bayesian Stackelberg security game with five stage-specific actions per player is formulated, which examines whether simulated attack-action evidence can inform a defender that they must commit before an attacker’s type is known.

Zhao Shen, Rulong He, Xiao Zhang · 0 citations
Preprint Aug 2026

Knowing When to Ask for Help: Bayesian Self-Escalation in Hierarchical LLM Agents

The myopic escalation threshold is derived in closed form, characterise the optimal policy via dynamic programming, and it is proved that the optimal policy is a time-varying threshold with no shape assumption on the raw signal.

Nadeem Shaikh · 1 citation
Conference Aug 2026

Agentic AI for Autonomous Zero-Day Threat Detection in Zero-Trust Enterprise Security Architectures

Zero-day attacks exploit signature-based defenses since the key pieces of evidence used to identify attacks are not present during the training of the model. This paper proposes an Agentic Autonomous Zero-Trust (AAZT) framework that includes: Multimodal Open-set Detection, Evidence-grounded Multi-agent Investigation, C...

Anish Kumar Kodeboyina, Bhasker Chittanoori, Surya Raghavendra Kommisetti · 0 citations
#artificial intelligence Preprint Sep 2026

Reward Hacking and Agent Containment Failure: A Monte Carlo Study Based on the 2026 Hugging Face Incident

A probabilistic risk model linking five stages: reward hacking, containment escape, usable access, persistence, and failure of detection supports treating cyber-capable agent evaluations as hostile security zones in which indirect egress, shared infrastructure, credentials, and evaluation artifacts must remain outside...

Murat Ozer, Bulent Erenay, Ibrahim Berber · 1 citation
Preprint Sep 2026

Deception in Reach-Avoid Game with Unknown Heterogeneous Attackers Speed Information

It is demonstrated that under certain initial conditions, the Attackers can mislead the Defender into making suboptimal decisions through a slow-speed deception strategy, achieving superior payoffs compared to the complete information game.

Xiang-Kai Wu, Shaolin Tan, Wei Wang et al. · 0 citations
Case report Open access Sep 2026

When Higher Stakes Weaken Security

A central design goal of settlement systems is that security should not degrade when transaction values are high. Using Ethereum’s Proof-of-Work era, we show that Proof-of-Work can fail this test: higher transaction fees—the reward for a successful attack—cause miners to deviate from honest behavior and fork the chain,...

Pablo D. Azar, Maryam Farboodi · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.