Paper published in a journal (Scientific congresses, symposiums and conference proceedings)
Fast and optimal countermeasure selection for attack defence trees
Muller, Steve; Harpes, Carlo; Muller, Cédric
2017In Lecture Notes in Computer Science, 10224 LNCS, p. 53-65
Peer reviewed
 

Files


Full Text
authors_copy.pdf
Author preprint (287.64 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Attack-defence tree; Branch and bound algorithm; Optimal defences; Return On Security Investment; Risk treatment optimisation; Branch and bound method; Forestry; Optimization; Quality assurance; Risk management; Risk perception; Software testing; Trees (mathematics); Branch-and-bound algorithms; Optimisations; Security investments; Risk assessment
Abstract :
[en] Risk treatment is an important part of risk management, and deals with the question which security controls shall be implemented in order to mitigate risk. Indeed, most notably when the mitigated risk is low, the costs engendered by the implementation of a security control may exceed its benefits. The question becomes particularly interesting if there are several countermeasures to choose from. A promising candidate for modeling the effect of defensive mechanisms on a risk scenario are attack–defence trees. Such trees allow one to compute the risk of a scenario before and after the implementation of a security control, and thus to weigh its benefits against its costs. A naive approach for finding an optimal set of security controls is to try out all possible combinations. However, such a procedure quickly reaches its limits already for a small number of defences. This paper presents a novel branch-and-bound algorithm, which skips a large part of the combinations that cannot lead to an optimal solution. The performance is thereby increased by several orders of magnitude compared to the pure brute–force version. © 2017, Springer International Publishing AG.
Disciplines :
Computer science
Identifiers :
eid=2-s2.0-85018429810
Author, co-author :
Muller, Steve ;  [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Harpes, Carlo;  itrust consulting s.à r.l., Niederanven, Luxembourg
Muller, Cédric;  itrust consulting s.à r.l., Niederanven, Luxembourg
External co-authors :
no
Language :
English
Title :
Fast and optimal countermeasure selection for attack defence trees
Publication date :
2017
Event name :
4th International Workshop on Risk Assessment and Risk Driven Quality Assurance, RISK 2016 held in conjunction with 28th International Conference on Testing Software and Systems, ICTSS 2016
Event date :
18 October 2016 through 18 October 2016
Audience :
International
Journal title :
Lecture Notes in Computer Science
ISSN :
0302-9743
eISSN :
1611-3349
Publisher :
Springer
Volume :
10224 LNCS
Pages :
53-65
Peer reviewed :
Peer reviewed
Focus Area :
Security, Reliability and Trust
Funders :
10239425, FNR, Fonds National de la Recherche Luxembourg
Commentary :
191379 9783319578576
Available on ORBilu :
since 01 December 2017

Statistics


Number of views
79 (7 by Unilu)
Number of downloads
3 (3 by Unilu)

Scopus citations®
 
1
Scopus citations®
without self-citations
1
OpenCitations
 
0
WoS citations
 
0

Bibliography


Similar publications



Contact ORBilu