EEMCS EPrints Service
Kumar, Rajesh and Guck, D. and Stoelinga, M.I.A. (2015) Time dependent analysis with dynamic counter measure trees. In: Proceedings of the 13th Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL 2015), 11-12 April 2015, London, England. pp. 1-5. Inria. ISSN not assigned ISBN not assigned
Full text available as:
Official URL: http://arxiv.org/pdf/1510.00050.pdf
The success of a security attack crucially depends on time: the more time available to the attacker, the higher the probability of a successful attack. Formalisms such as Reliability block diagrams, Reliability graphs and Attack Countermeasure trees provide quantitative information about attack scenarios, but they are provably insufficient to model dependent actions which involve costs, skills, and time. In this presentation, we extend the Attack Countermeasure trees with a notion of time; inspired by the fact that there is a strong correlation between the amount of resources in which the attacker invests (in this case time) and probability that an attacker succeeds. This allows for an effective selection of countermeasures and rank them according to their resource consumption in terms of costs/skills of installing them and effectiveness in preventing an attack.
Export this item as:
To correct this item please ask your editor
Repository Staff Only: edit this item