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
{"_id":{"_str":"53f475e53d9d602c1a0012b3"},"__v":4,"authorIDs":["5457089d8b01c8193000012f","5a8SaRQZEqQauLeSj","5dec2eeed39dc7de01000059","5defa628706001de01000155","5df0bf368367c8de0100014e","5df7a6a2f3cb28df0100013e","5df8c7c4e6b510df0100018c","5df8e4de877972de0100016c","5df99361c4ada8de01000018","5dfea9342331dfdf01000059","5e012b722e225bde01000053","5e0968c8ade67ddf01000043","5e0b068b3830a1df010000e1","5e10a884cfb06ddf0100002c","5e10fd55d6a01ede01000024","5e142e4b12768ef30100003c","5e1961659eca7cdf01000080","5e1a2ca69fbdddde010000ff","5e1f814208195af3010000a8","5e2b62d96366e2df010000e6","5e2b8ef4f92538df01000011","5e2d73a3556d50df01000041","5e30e7755f9c1cf2010000d7","5e35f2395cd57fde010000c7","5e3a22e3c268d2de01000108","5e3b007c55f0f2df0100011a","5e3e128b4cdb49de0100008a","5e4094bbd668c6de0100007c","5e40f782fd6934df01000169","5e413b68b7d170df01000092","5e42e16aa6f4a6f2010000d1","5e4eddeb2962cadf010000e9","5e54f08fb8e445df01000107","6rZ7TmdCqfG4dxRdT","Q5h43gs9oNpAm4KeK","Zw3hLXQ8Xyab4HobY"],"author_short":["Bistarelli, S.","Peretti, P.","Trubitsyna, I."],"bibbaseid":"bistarelli-peretti-trubitsyna-analyzingsecurityscenariosusingdefencetreesandanswersetprogramming-2008","bibdata":{"bibtype":"conference","type":"conference","author":[{"propositions":[],"lastnames":["Bistarelli"],"firstnames":["Stefano"],"suffixes":[]},{"propositions":[],"lastnames":["Peretti"],"firstnames":["Pamela"],"suffixes":[]},{"propositions":[],"lastnames":["Trubitsyna"],"firstnames":["Irina"],"suffixes":[]}],"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","bibtex":"@conference{\n\t11391_121117,\n\tauthor = {Bistarelli, Stefano and Peretti, Pamela and Trubitsyna, Irina},\n\ttitle = {Analyzing security scenarios using Defence Trees and Answer Set Programming},\n\tyear = {2008},\n\tpublisher = {ELSEVIER},\n\tjournal = {ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE},\n\tvolume = {197},\n\tbooktitle = {Proceedings of the 3rd International Workshop on Security and Trust Management (STM 2007)},\n\tabstract = {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.\r\n\r\nIn 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.},\n\tkeywords = {Defence tree; Answer Set Programming; CR-Prolog},\n\tdoi = {10.1016/j.entcs.2007.12.021},\t\n\tpages = {121--129}\n}\n","author_short":["Bistarelli, S.","Peretti, P.","Trubitsyna, I."],"key":"11391_121117","id":"11391_121117","bibbaseid":"bistarelli-peretti-trubitsyna-analyzingsecurityscenariosusingdefencetreesandanswersetprogramming-2008","role":"author","urls":{},"keyword":["Defence tree; Answer Set Programming; CR-Prolog"],"metadata":{"authorlinks":{"bistarelli, s":"https://bista.sites.dmi.unipg.it/papers/"}},"downloads":0,"html":""},"bibtype":"conference","biburl":"http://www.dmi.unipg.it/~bista/papers/pubblicazioni.bib","creationDate":"2014-08-20T10:18:13.779Z","downloads":0,"keywords":["defence tree; answer set programming; cr-prolog"],"search_terms":["analyzing","security","scenarios","using","defence","trees","answer","set","programming","bistarelli","peretti","trubitsyna"],"title":"Analyzing security scenarios using Defence Trees and Answer Set Programming","year":2008,"dataSources":["GhB5rb8JzW6az3exo","T6HLi2LBH4teAezac"]}