<p>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 <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\lambda \)</EquationSource> </InlineEquation>-sensor-attack detectability (<InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\lambda \)</EquationSource> </InlineEquation>-sa), a formal measure that evaluates the likelihood of a system being under attack based on observed behaviors. Our framework enhances detection capabilities by using probabilistic information to detect attacks across the class of all complete, consistent, and successful sensor attack strategies, which enables the detection of sensor attacks that remain undetectable to current detection methodologies. We develop a polynomial-time algorithm that verifies <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\lambda \)</EquationSource> </InlineEquation>-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 (<InlineEquation ID="IEq4"> <EquationSource Format="TEX">\(\lambda \)</EquationSource> </InlineEquation>*) achievable by the system, ensuring the highest probability of identifying attack-induced behaviors.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

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

  • Parastou Fahim,
  • Samuel Oliveira,
  • Rômulo Meira-Góes

摘要

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 \(\lambda \) -sensor-attack detectability ( \(\lambda \) -sa), a formal measure that evaluates the likelihood of a system being under attack based on observed behaviors. Our framework enhances detection capabilities by using probabilistic information to detect attacks across the class of all complete, consistent, and successful sensor attack strategies, which enables the detection of sensor attacks that remain undetectable to current detection methodologies. We develop a polynomial-time algorithm that verifies \(\lambda \) -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 ( \(\lambda \) *) achievable by the system, ensuring the highest probability of identifying attack-induced behaviors.