In this paper, a general framework is proposed for the analysis and characterization of critical observability of finite state systems, affected by malicious attacks. Critical observability is defined with respect to a critical set, and corresponds to the property of immediately detecting the belonging of the current state to such critical set, based on the knowledge of the output evolution of the system. This concept, analyzed before for the nominal case, in which the model is known, as well as the function which associates to each state an output symbol, is here extended to the case in which there is an intrusion in the system, which could cause replacement or removal of output symbols, or injection of symbols in the output string. Therefore the problem consists in giving conditions under which critical observability is preserved, despite possible attacks. Different attacker models are considered. The case of attacks where the presence of the attacker cannot be detected is also addressed. The problem is solved in a set membership framework, which guarantees polynomial complexity of the proposed algorithms.

Critical observability of finite state machines under attacks

De Santis E.;Di Benedetto M. D.
2021

Abstract

In this paper, a general framework is proposed for the analysis and characterization of critical observability of finite state systems, affected by malicious attacks. Critical observability is defined with respect to a critical set, and corresponds to the property of immediately detecting the belonging of the current state to such critical set, based on the knowledge of the output evolution of the system. This concept, analyzed before for the nominal case, in which the model is known, as well as the function which associates to each state an output symbol, is here extended to the case in which there is an intrusion in the system, which could cause replacement or removal of output symbols, or injection of symbols in the output string. Therefore the problem consists in giving conditions under which critical observability is preserved, despite possible attacks. Different attacker models are considered. The case of attacks where the presence of the attacker cannot be detected is also addressed. The problem is solved in a set membership framework, which guarantees polynomial complexity of the proposed algorithms.
978-1-6654-2258-1
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11697/179568
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact