Robust Stealthy Attacks Based on Uncertain Costs and Labeled Finite Automata With Inputs
- 27 February 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Robotics and Automation Letters
- Vol. 8 (5) , 2732-2739
Abstract
This letter deals with the vulnerability analysis of cyber-physical systems subject to malicious actions. For this purpose, the considered system is assumed to be abstracted as a discrete event system. Labeled finite automata with inputs are used to model the system's behavior along with the information that circulates in both the input and output channels. In particular, we study here stealthy, i.e., undetectable, cyber-attacks that aim to drive the system from a given normal state to a set of forbidden states. We assume that the attacker has limited resources, i.e., a credit, to insert and delete control and sensors events. The proposed analysis evaluates the costs of such attacks on the controlled system depending on its structure, the cost of the malicious actions and possible uncertainties that may affect those costs. It provides systematic methods that aim to compute attacks of minimal cost and robust attacks that are weakly impacted by uncertainties. A case study representing a manufacturing plant is considered to illustrate the results.Keywords
Funding Information
- CPSecurity (CNRS-INS2I)
- Agence Nationale de la Recherche (ANR-22-CE10-0002)
This publication has 21 references indexed in Scilit:
- Security Against Communication Network Attacks of Cyber-Physical SystemsJournal of Control, Automation and Electrical Systems, 2018
- Introduction to the IEEE 1788-2015 Standard for Interval Arithmetic2017
- A multi-layered and kill-chain based security analysis framework for cyber-physical systemsInternational Journal of Critical Infrastructure Protection, 2015
- Unmanned Aircraft Capture and Control Via GPS SpoofingJournal of Field Robotics, 2014
- Cyber Security Analytics: A Stochastic Model for Security Quantification Using Absorbing Markov ChainsJournal of Communications, 2014
- Exploring attack graph for cost-benefit security hardening: A probabilistic approachComputers & Security, 2013
- Stuxnet and the Future of Cyber WarSurvival, 2011
- Min–max and min–max regret versions of combinatorial optimization problems: A surveyEuropean Journal of Operational Research, 2009
- The Price of RobustnessOperations Research, 2004
- Robust Discrete Optimization and Its Applications1997