Is My Attack Tree Correct?

被引：24

作者：

Audinot, Maxime ^{[1
,2
]}

Pinchinat, Sophie ^{[1
,2
]}

Kordy, Barbara ^{[1
,3
]}

机构：

[1] IRISA, Rennes, Ille & Vilaine, France

[2] Univ Rennes 1, Rennes, Ille & Vilaine, France

[3] INSA Rennes, Rennes, Ille & Vilaine, France

来源：

COMPUTER SECURITY - ESORICS 2017, PT I | 2018年 / 10492卷

关键词：

D O I：

10.1007/978-3-319-66402-6_7

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Attack trees are a popular way to represent and evaluate potential security threats on systems or infrastructures. The goal of this work is to provide a framework allowing to express and check whether an attack tree is consistent with the analyzed system. We model real systems using transition systems and introduce attack trees with formally specified node labels. We formulate the correctness properties of an attack tree with respect to a system and study the complexity of the corresponding decision problems. The proposed framework can be used in practice to assist security experts in manual creation of attack trees and enhance development of tools for automated generation of attack trees.

引用

页码：83 / 102

页数：20

共 30 条

[1]

[Anonymous], 1981, Lecture Notes in Computer Science, DOI DOI 10.1007/BFB0025774

[2] Pareto efficient solutions of attack-defence trees [J].

Aslanyan, Zaruhi ;

Nielson, Flemming .

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2015, 9036 :95-114

[3] Model Checking Exact Cost for Attack Scenarios [J].

Aslanyan, Zaruhi ;

Nielson, Flemming .

PRINCIPLES OF SECURITY AND TRUST (POST 2017), 2017, 10204 :210-231

[4]

Audinot M., 2017, ABS170608507 CORR

[5] On the Soundness of Attack Trees [J].

Audinot, Maxime ;

Pinchinat, Sophie .

GRAPHICAL MODELS FOR SECURITY, GRAMSEC 2016, 2016, 9987 :25-38

[6]

Cook S. A., 1971, Proceedings of the 3rd annual ACM symposium on theory of computing, P151

[7]

De Giacomo Giuseppe., 2013, P 23 IJCAI, P854, DOI 10.5555/2540128.2540252

[8] Modelling Attack-defense Trees Using Timed Automata [J].

Gadyatskaya, Olga ;

Hansen, Rene Rydhof ;

Larsen, Kim Guldstrand ;

Legay, Axel ;

Olesen, Mads Chr. ;

Poulsen, Danny Bogsted .

FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, FORMATS 2016, 2016, 9884 :35-50

[9]

Garey Michael R, 2002, COMPUTERS INTRACTABI, V29

[10] Semantics for Specialising Attack Trees based on Linear Logic [J].

Horne, Ross ;

Mauw, Sjouke ;

Tiu, Alwen .

FUNDAMENTA INFORMATICAE, 2017, 153 (1-2) :57-86

← 1 2 3 →