Enhancing sensor attack detection in supervisory control systems modeled by probabilistic automata

Abstract

Sensor attacks compromise the reliability of cyber-physical systems (CPSs) by altering sensor outputs with the objective of leading the system to unsafe system states. This paper studies a probabilistic intrusion detection framework based on λ-sensor-attack detectability (λ-sa), a formal measure that evaluates the likelihood of a system being under attack based on observed behaviors. Our framework enhances detection by extending its capabilities to identify multiple sensor attack strategies using probabilistic information, which enables the detection of sensor attacks that were undetected by current detection methodologies. We develop a polynomial-time algorithm that verifies λ-sa detectability by constructing a weighted verifier automaton and solving the shortest path problem. Additionally, we propose a method to determine the maximum detection confidence level (λ*) achievable by the system, ensuring the highest probability of identifying attack-induced behaviors.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…