Resource-Aware Intrusion Detection in Infrastructure Networks: A Game-Theoretic Approach

• URL: http://arxiv.org/abs/2608.06655v1
• Date: Fri, 07 Aug 2026 00:00:37 GMT
• Title: Resource-Aware Intrusion Detection in Infrastructure Networks: A Game-Theoretic Approach
• Abstract summary: We study how sensing and processing resources should be allocated under strategic interaction between a defender and an attacker.<n>We formulate their interaction as a graph security game in which the defender deploys sensing actions under resource and false alarm constraints.<n>We develop algorithms that construct effective pure configurations and refine restricted games for mixed Nash and mixed Stackelberg play.
• Score: 9.869799577950195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Infrastructure networks increasingly rely on distributed sensing to detect intrusions before attackers reach valuable assets. Yet sensing devices, communication resources, and edge server capacity are limited, while intelligent attackers can adapt their routes to the deployed defense. Motivated by integrated sensing and communication (ISAC), we study how sensing and processing resources should be allocated under strategic interaction between a defender and an attacker. We formulate their interaction as a graph security game in which the defender deploys sensing actions under resource and false alarm constraints, while the attacker selects routes to valuable targets. We consider simultaneous play and settings in which the attacker observes either a pure defender configuration or a mixed defender strategy. Our analysis characterizes the existence, structure, and computational complexity of the Nash and Stackelberg equilibria, showing how the attacker's observation of the defense affects equilibrium behavior and when optimal strategies become difficult to compute. We develop algorithms that construct effective pure configurations and refine restricted games for mixed Nash and mixed Stackelberg play. On enumerable instances, their solutions have small mean normalized differences from fully enumerated references; the methods also apply when exhaustive strategy enumeration is impractical. We also identify conditions under which Nash and mixed Stackelberg payoffs are ordered or coincide.

Related papers

• Stateful Cooperative Agents Safeguarding LLMs Against Evolving Multi-Turn Attacks [56.45762972211923]
  We present a proactive defense framework for securing LLMs against evolving multi-turn adversarial attacks.<n>It employs a cooperative multi-agent architecture in which specialized agents execute complementary defense strategies.<n>We present the EMRA dataset designed to simulate evolving strategies across multi-turn attacks.
  arXiv  Detail & Related papers  (2026-07-31T14:04:49Z)
• Game-Theoretic Modeling of Stealthy Intrusion Defense against MDP-Based Attackers [1.230067722774416]
  We model advanced persistent threats as a strategic interaction between an attacker and a defender on an attack graph.<n>With limited information about the attacker's position and progress, the defender acts at random intervals by deploying intrusion detection sensors.<n>We derive optimal defensive strategies by solving the corresponding optimization problems.
  arXiv  Detail & Related papers  (2026-03-10T12:35:57Z)
• Attacking and Securing Community Detection: A Game-Theoretic Framework [22.20017945724223]
  adversarial graphs can cause deep graph models to fail on classification tasks.<n>We propose novel attack and defense techniques for community detection problem.<n>These techniques have many applications in real-world scenarios, for example, protecting personal privacy in social networks.
  arXiv  Detail & Related papers  (2025-12-12T08:17:33Z)
• Chasing Moving Targets with Online Self-Play Reinforcement Learning for Safer Language Models [64.47869632167284]
  Conventional language model (LM) safety alignment relies on a reactive, disjoint procedure: attackers exploit a static model, followed by defensive fine-tuning to patch exposed vulnerabilities.<n>This sequential approach creates a mismatch -- attackers overfit to obsolete defenses, while defenders perpetually lag behind emerging threats.<n>We propose Self-RedTeam, an online self-play reinforcement learning algorithm where an attacker and defender agent co-evolve through continuous interaction.
  arXiv  Detail & Related papers  (2025-06-09T06:35:12Z)
• Mind the Gap: Detecting Black-box Adversarial Attacks in the Making through Query Update Analysis [3.795071937009966]
  Adrial attacks can jeopardize the integrity of Machine Learning (ML) models.<n>We propose a framework that detects if an adversarial noise instance is being generated.<n>We evaluate our approach against 8 state-of-the-art attacks, including adaptive attacks.
  arXiv  Detail & Related papers  (2025-03-04T20:25:12Z)
• Illusory Attacks: Information-Theoretic Detectability Matters in Adversarial Attacks [76.35478518372692]
  We introduce epsilon-illusory, a novel form of adversarial attack on sequential decision-makers. Compared to existing attacks, we empirically find epsilon-illusory to be significantly harder to detect with automated methods. Our findings suggest the need for better anomaly detectors, as well as effective hardware- and system-level defenses.
  arXiv  Detail & Related papers  (2022-07-20T19:49:09Z)
• Game-Theoretic Neyman-Pearson Detection to Combat Strategic Evasion [17.014913888753238]
  This work aims to develop a holistic theory to countermeasure such evasive attacks.<n>We propose game-theoretic frameworks to capture the conflicting relationship between a strategic evasive attacker and an evasion-aware NP detector.<n>We show that the evasion-aware NP detectors outperform the passive ones in the way that the former can act strategically against the attacker's behavior.
  arXiv  Detail & Related papers  (2022-06-10T23:16:41Z)
• Mixed Strategies for Security Games with General Defending Requirements [37.02840909260615]
  The Stackelberg security game is played between a defender and an attacker, where the defender needs to allocate a limited amount of resources to multiple targets. We propose an efficient close-to-optimal Patching algorithm that computes mixed strategies that use only few pure strategies.
  arXiv  Detail & Related papers  (2022-04-26T08:56:39Z)
• Zero-Query Transfer Attacks on Context-Aware Object Detectors [95.18656036716972]
  Adversarial attacks perturb images such that a deep neural network produces incorrect classification results. A promising approach to defend against adversarial attacks on natural multi-object scenes is to impose a context-consistency check. We present the first approach for generating context-consistent adversarial attacks that can evade the context-consistency check.
  arXiv  Detail & Related papers  (2022-03-29T04:33:06Z)
• Fixed Points in Cyber Space: Rethinking Optimal Evasion Attacks in the Age of AI-NIDS [70.60975663021952]
  We study blackbox adversarial attacks on network classifiers. We argue that attacker-defender fixed points are themselves general-sum games with complex phase transitions. We show that a continual learning approach is required to study attacker-defender dynamics.
  arXiv  Detail & Related papers  (2021-11-23T23:42:16Z)
• The Feasibility and Inevitability of Stealth Attacks [63.14766152741211]
  We study new adversarial perturbations that enable an attacker to gain control over decisions in generic Artificial Intelligence systems. In contrast to adversarial data modification, the attack mechanism we consider here involves alterations to the AI system itself.
  arXiv  Detail & Related papers  (2021-06-26T10:50:07Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.