University of Groningen
Resilience of coordination networks: data availability and integrity
Mohammadi Senejohnny, Danial
IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish to cite from
it. Please check the document version below.
Document Version
Publisher's PDF, also known as Version of record
Publication date:
2018
Link to publication in University of Groningen/UMCG research database
Citation for published version (APA):
Mohammadi Senejohnny, D. (2018). Resilience of coordination networks: data availability and integrity.
Rijksuniversiteit Groningen.
Copyright
Other than for strictly personal use, it is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license (like Creative Commons).
Take-down policy
If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim.
Downloaded from the University of Groningen/UMCG research database (Pure): http://www.rug.nl/research/portal. For technical reasons the number of authors shown on this cover page is limited to 10 maximum.
Stellingen
behorende bij het proefschrift Resilience of Coordination Networks:
Data Availability and Integrity van Danial M. Senejohnny
1. Computer science and IT provide prevention mechanisms as the first layer of protection for the security of control systems. As an extra layer, resi-lient control addresses the extent to which a control system can continue to operate if an attack turns out to be successful.
2. The traditional information security CIA triad Confidentiality, Integrity, and Availability also applies to OT networks. In IT networks the order of importance is represented by C-I-A, while in OT networks it is represented by A-I-C.
3. In CPS, networked communication is inherently digital and the rate at which the transmissions are scheduled cannot be arbitrarily large. 4. The PoC condition guarantees graph/link connectivity is established over
periods of time that the digital communication medium is active. Part I 5. The problem of achieving consensus under DoS can be naturally cast as a consensus problem for networks with switching topologies. Part I 6. A fundamental challenge is to ensure that networked systems function even when some of the network nodes do not operate as intended due to
faults or attacks. Part II
7. The resilient consensus protocol achieves approximate consensus even with F number of misbehaving nodes if every pair of normal nodes has at least
3F + 1 nodes in common. Chapter 5
8. The resilient coordination protocol achieves asymptotic consensus even with F number of misbehaving nodes if the graph is (F + 1, F + 1)-robust. Chapter 6
