Analyzing security scenarios using Defence Trees and Answer Set Programming. Bistarelli, S., Peretti, P., & Trubitsyna, I. 2008.
doi  abstract   bibtex   
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to stop all the vulnerabilities. In order to represent preferences among possible countermeasures of a given attack, defence trees are enriched with conditional preferences, obtaining a new structure called CP-defence tree. In this paper we transform a CP-defence tree with preferences among attacks and countermeasures in an Answer Set Optimization (ASO) program. The ASO program, representing the overall scenario, is a special composition of the programs associated to each branch of a CP-defence tree. We describe an implementation that select the best set of countermeasure able to mitigate all the vulnerabilities by computing the optimal answer set of the corresponding ASO program.
@conference{
	11391_121117,
	author = {Bistarelli, Stefano and Peretti, Pamela and Trubitsyna, Irina},
	title = {Analyzing security scenarios using Defence Trees and Answer Set Programming},
	year = {2008},
	publisher = {ELSEVIER},
	journal = {ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE},
	volume = {197},
	booktitle = {Proceedings of the 3rd International Workshop on Security and Trust Management (STM 2007)},
	abstract = {Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to stop all the vulnerabilities.

In order to represent preferences among possible countermeasures of a given attack, defence trees are enriched with conditional preferences, obtaining a new structure called CP-defence tree. In this paper we transform a CP-defence tree with preferences among attacks and countermeasures in an Answer Set Optimization (ASO) program. The ASO program, representing the overall scenario, is a special composition of the programs associated to each branch of a CP-defence tree. We describe an implementation that select the best set of countermeasure able to mitigate all the vulnerabilities by computing the optimal answer set of the corresponding ASO program.},
	keywords = {Defence tree; Answer Set Programming; CR-Prolog},
	doi = {10.1016/j.entcs.2007.12.021},	
	pages = {121--129}
}

Downloads: 0