On cyber attacks and the maximum-weight rooted-subtree problem
This paper makes three contributions to cyber-security research. First, we define a model for cyber-security systems and the concept of a cyber-security attack within the model's framework. The model highlights the importance of game-over components - critical system components which if acquire...
Saved in:
Main Authors: | Geir Agnarsson, Raymond Greenlaw, Sanpawat Kantabutra |
---|---|
Format: | Journal |
Published: |
2018
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=84983353699&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/55610 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
Similar Items
-
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
by: Geir Agnarsson, et al.
Published: (2018) -
The complexity of cyber attacks in a new layered-security model and the maximum-weight, rooted-subtree problem
by: Geir Agnarsson, et al.
Published: (2018) -
On cyber attacks and the maximum-weight rooted-subtree problem
by: Agnarsson G., et al.
Published: (2017) -
The structure of rooted weighted trees modeling layered cyber-security systems
by: Geir Agnarsson, et al.
Published: (2018) -
The graph relabeling problem and its variants
by: Geir Agnarsson, et al.
Published: (2018)