Genetic Approximations for the Failure-Free Security Games

Aleksandr Lenin; Jan Willemson; Anton Charnamord

doi:10.1007/978-3-319-25594-1_17

Genetic Approximations for the Failure-Free Security Games

Aleksandr Lenin^*, Jan Willemson, Anton Charnamord

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

2 Citations (Scopus)

Abstract

This paper deals with computational aspects of attack trees, more precisely, evaluating the expected adversarial utility in the failure-free game, where the adversary is allowed to re-run failed atomic attacks an unlimited number of times. It has been shown by Buldas and Lenin that exact evaluation of this utility is an NP-complete problem, so a computationally feasible approximation is needed. In this paper we consider a genetic approach for this challenge. Since genetic algorithms depend on a number of non-trivial parameters, we face a multi-objective optimization problem and we consider several heuristic criteria to solve it.

Original language	English
Title of host publication	Decision and Game Theory for Security
Subtitle of host publication	6th International Conference, GameSec 2015 London, UK, November 4-5, 2015 Proceedings
Editors	MHR Khouzani, Emmanouil Panaousis, George Theodorakopoulos
Place of Publication	London
Publisher	Springer
Pages	311-321
Number of pages	11
ISBN (Electronic)	978-3-319-25594-1
ISBN (Print)	978-3-319-25593-4
DOIs	https://doi.org/10.1007/978-3-319-25594-1_17
Publication status	Published - 2015
Event	6th International Conference on Decision and Game Theory for Security, GameSec 2015 - London, United Kingdom Duration: 4 Nov 2015 → 5 Nov 2015 Conference number: 6

Publication series

Name	Lecture notes in computer science
Publisher	Springer
Volume	9406
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	6th International Conference on Decision and Game Theory for Security, GameSec 2015
Abbreviated title	GameSec
Country	United Kingdom
City	London
Period	4/11/15 → 5/11/15

Keywords

EC Grant Agreement nr.: FP7/318003
EC Grant Agreement nr.: FP7/2007-2013
Genetic algorithm
Mutation rate
Crossover operator
Crossover rate
Attack trees

Access to Document

10.1007/978-3-319-25594-1_17

Fingerprint Dive into the research topics of 'Genetic Approximations for the Failure-Free Security Games'. Together they form a unique fingerprint.

Cite this

Lenin, A., Willemson, J., & Charnamord, A. (2015). Genetic Approximations for the Failure-Free Security Games. In MHR. Khouzani, E. Panaousis, & G. Theodorakopoulos (Eds.), Decision and Game Theory for Security: 6th International Conference, GameSec 2015 London, UK, November 4-5, 2015 Proceedings (pp. 311-321). (Lecture notes in computer science; Vol. 9406). Springer. https://doi.org/10.1007/978-3-319-25594-1_17

Lenin, Aleksandr ; Willemson, Jan ; Charnamord, Anton. / Genetic Approximations for the Failure-Free Security Games. Decision and Game Theory for Security: 6th International Conference, GameSec 2015 London, UK, November 4-5, 2015 Proceedings. editor / MHR Khouzani ; Emmanouil Panaousis ; George Theodorakopoulos. London : Springer, 2015. pp. 311-321 (Lecture notes in computer science).

@inproceedings{33841922066d4df390ff5b17b0ba2167,

title = "Genetic Approximations for the Failure-Free Security Games",

abstract = "This paper deals with computational aspects of attack trees, more precisely, evaluating the expected adversarial utility in the failure-free game, where the adversary is allowed to re-run failed atomic attacks an unlimited number of times. It has been shown by Buldas and Lenin that exact evaluation of this utility is an NP-complete problem, so a computationally feasible approximation is needed. In this paper we consider a genetic approach for this challenge. Since genetic algorithms depend on a number of non-trivial parameters, we face a multi-objective optimization problem and we consider several heuristic criteria to solve it.",

keywords = "EC Grant Agreement nr.: FP7/318003, EC Grant Agreement nr.: FP7/2007-2013, Genetic algorithm, Mutation rate, Crossover operator, Crossover rate, Attack trees",

author = "Aleksandr Lenin and Jan Willemson and Anton Charnamord",

year = "2015",

doi = "10.1007/978-3-319-25594-1_17",

language = "English",

isbn = "978-3-319-25593-4",

series = "Lecture notes in computer science",

publisher = "Springer",

pages = "311--321",

editor = "MHR Khouzani and Emmanouil Panaousis and George Theodorakopoulos",

booktitle = "Decision and Game Theory for Security",

note = "6th International Conference on Decision and Game Theory for Security, GameSec 2015, GameSec ; Conference date: 04-11-2015 Through 05-11-2015",

}

Lenin, A, Willemson, J & Charnamord, A 2015, Genetic Approximations for the Failure-Free Security Games. in MHR Khouzani, E Panaousis & G Theodorakopoulos (eds), Decision and Game Theory for Security: 6th International Conference, GameSec 2015 London, UK, November 4-5, 2015 Proceedings. Lecture notes in computer science, vol. 9406, Springer, London, pp. 311-321, 6th International Conference on Decision and Game Theory for Security, GameSec 2015, London, United Kingdom, 4/11/15. https://doi.org/10.1007/978-3-319-25594-1_17

Genetic Approximations for the Failure-Free Security Games. / Lenin, Aleksandr; Willemson, Jan; Charnamord, Anton.

Decision and Game Theory for Security: 6th International Conference, GameSec 2015 London, UK, November 4-5, 2015 Proceedings. ed. / MHR Khouzani; Emmanouil Panaousis; George Theodorakopoulos. London : Springer, 2015. p. 311-321 (Lecture notes in computer science; Vol. 9406).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Genetic Approximations for the Failure-Free Security Games

AU - Lenin, Aleksandr

AU - Willemson, Jan

AU - Charnamord, Anton

N1 - Conference code: 6

PY - 2015

Y1 - 2015

N2 - This paper deals with computational aspects of attack trees, more precisely, evaluating the expected adversarial utility in the failure-free game, where the adversary is allowed to re-run failed atomic attacks an unlimited number of times. It has been shown by Buldas and Lenin that exact evaluation of this utility is an NP-complete problem, so a computationally feasible approximation is needed. In this paper we consider a genetic approach for this challenge. Since genetic algorithms depend on a number of non-trivial parameters, we face a multi-objective optimization problem and we consider several heuristic criteria to solve it.

AB - This paper deals with computational aspects of attack trees, more precisely, evaluating the expected adversarial utility in the failure-free game, where the adversary is allowed to re-run failed atomic attacks an unlimited number of times. It has been shown by Buldas and Lenin that exact evaluation of this utility is an NP-complete problem, so a computationally feasible approximation is needed. In this paper we consider a genetic approach for this challenge. Since genetic algorithms depend on a number of non-trivial parameters, we face a multi-objective optimization problem and we consider several heuristic criteria to solve it.

KW - EC Grant Agreement nr.: FP7/318003

KW - EC Grant Agreement nr.: FP7/2007-2013

KW - Genetic algorithm

KW - Mutation rate

KW - Crossover operator

KW - Crossover rate

KW - Attack trees

U2 - 10.1007/978-3-319-25594-1_17

DO - 10.1007/978-3-319-25594-1_17

M3 - Conference contribution

SN - 978-3-319-25593-4

T3 - Lecture notes in computer science

SP - 311

EP - 321

BT - Decision and Game Theory for Security

A2 - Khouzani, MHR

A2 - Panaousis, Emmanouil

A2 - Theodorakopoulos, George

PB - Springer

CY - London

T2 - 6th International Conference on Decision and Game Theory for Security, GameSec 2015

Y2 - 4 November 2015 through 5 November 2015

ER -

Lenin A, Willemson J, Charnamord A. Genetic Approximations for the Failure-Free Security Games. In Khouzani MHR, Panaousis E, Theodorakopoulos G, editors, Decision and Game Theory for Security: 6th International Conference, GameSec 2015 London, UK, November 4-5, 2015 Proceedings. London: Springer. 2015. p. 311-321. (Lecture notes in computer science). https://doi.org/10.1007/978-3-319-25594-1_17