On a Generic Security Game Model
Vivek Shandilya, Sajjan Shiva

TL;DR
This paper introduces a generic stochastic security game model with imperfect information, capturing complex attacker-defender interactions and sensor errors, and demonstrates its application through numerical simulations.
Contribution
It presents a novel, flexible game model for cybersecurity interactions incorporating sensor errors and multi-attacker scenarios, advancing prior game-theoretic approaches.
Findings
Model captures various interaction modes with imperfect information.
Sensor errors are represented using Euclidean distances between sensor outputs.
Simulation illustrates strategy evaluation and reward optimization.
Abstract
To protect the systems exposed to the Internet against attacks, a security system with the capability to engage with the attacker is needed. There have been attempts to model the engagement/interactions between users, both benign and malicious, and network administrators as games. Building on such works, we present a game model which is generic enough to capture various modes of such interactions. The model facilitates stochastic games with imperfect information. The information is imperfect due to erroneous sensors leading to incorrect perception of the current state by the players. To model this error in perception distributed over other multiple states, we use Euclidean distances between the outputs of the sensors. We build a 5-state game to represent the interaction of the administrator with the user. The states correspond to 1) the user being out of the system in the Internet, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
