On the computational complexity of the secure state-reconstruction problem
Authors:
- Yanwen MaoYMYanwen Mao
- Aritra MitraAMAritra Mitra
- Shreyas SundaramSSShreyas Sundaram
- Paulo TabuadaPTPaulo Tabuada
- 1 February 2022
- journal article
- research article
- Published by Elsevier in Automatica
- Vol. 136
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (1653648, 1740047)
- NSF
- Army Research Laboratory (W911NF-17-2-0196)
This publication has 24 references indexed in Scilit:
- Event-Triggered State Observers for Sparse Sensor Noise/AttacksIEEE Transactions on Automatic Control, 2015
- Fault-Tolerant Consensus in Directed Graphs2015
- Covert Misappropriation of Networked Control Systems: Presenting a Feedback StructureIEEE Control Systems, 2015
- Secure Estimation and Control for Cyber-Physical Systems Under Adversarial AttacksIEEE Transactions on Automatic Control, 2014
- Attack Detection and Identification in Cyber-Physical SystemsIEEE Transactions on Automatic Control, 2013
- Stuxnet: Dissecting a Cyberwarfare WeaponIEEE Security & Privacy, 2011
- A Decoupled Feedback Structure for Covertly Appropriating Networked Control SystemsIFAC Proceedings Volumes, 2011
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Sparse Approximate Solutions to Linear SystemsSIAM Journal on Computing, 1995
- On the Complexity of Approximating Extremal Determinants in MatricesJournal of Complexity, 1995