On Fast and Approximate Attack Tree Computations

被引：0

作者：

Juergenson, Aivo ^{[1
,2
]}

Willemson, Jan ^{[3
]}

机构：

[1] Tallinn Univ Technol, Raja 15, EE-12618 Tallinn, Estonia

[2] Cybernetica, EE-12618 Tallinn, Estonia

[3] Cybernetica, EE-51004 Tartu, Estonia

来源：

INFORMATION SECURITY PRACTICE AND EXPERIENCE, PROCEEDINGS | 2010年 / 6047卷

关键词：

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

In this paper we address the problem of inefficiency of exact attack tree computations. We propose several implementation-level optimizations and introduce a genetic algorithm for fast approximate computations. Our experiments show that for attack trees having less than 30 leaves, the confidence level of 89% can be achieved within 2 seconds using this algorithm. The approximation scales very well and attack trees of practical size (up to 100 leaves) can be analyzed within a few minutes.

引用

页码：56 / +

页数：3

共 50 条

[1] Serial Model for Attack Tree Computations
Juergenson, Aivo
Willemson, Jan
INFORMATION SECURITY AND CRYPTOLOGY - ISISC 2009, 2010, 5984 : 118 - +
[2] FAST APPROXIMATE COMPUTATIONS WITH CAUCHY MATRICES AND POLYNOMIALS
Pan, Victor Y.
MATHEMATICS OF COMPUTATION, 2017, 86 (308) : 2799 - 2826
[3] A Fast Hardware Approach for Approximate, Efficient Logarithm and Antilogarithm Computations
Paul, Suganth
Jayakumar, Nikhil
Khatri, Sunil P.
IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2009, 17 (02) : 269 - 277
[4] Fast mining of massive tabular data via approximate distance computations
Cormode, G
Indyk, P
Koudas, N
Muthukrishnan, S
18TH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, PROCEEDINGS, 2002, : 605 - 614
[5] Fast tree-based redistancing for level set computations
Strain, J
JOURNAL OF COMPUTATIONAL PHYSICS, 1999, 152 (02) : 664 - 686
[6] Fast attack detection system using log analysis and attack tree generation
Kim, Duhoe
Kim, Yong-Hyun
Shin, Dongil
Shin, Dongkyoo
CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2019, 22 (Suppl 1): : 1827 - 1835
[7] Fast attack detection system using log analysis and attack tree generation
Duhoe Kim
Yong-Hyun Kim
Dongil Shin
Dongkyoo Shin
Cluster Computing, 2019, 22 : 1827 - 1835
[8] FAST SERIAL AND PARALLEL ALGORITHMS FOR APPROXIMATE TREE MATCHING WITH VLDCS
ZHANG, K
SHASHA, D
WANG, JTL
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 644 : 151 - 161
[9] A Fast and Efficient Fault Tree Analysis Using Approximate Computing
Hashemi, Salar
Hajisadeghi, Amir M.
Zarandi, Hamid R.
Pourmozafari, Saadat
2019 15TH EUROPEAN DEPENDABLE COMPUTING CONFERENCE (EDCC 2019), 2019, : 39 - 46
[10] Fast approximate minimum spanning tree based clustering algorithm
Jothi, R.
Mohanty, Sraban Kumar
Ojha, Aparajita
NEUROCOMPUTING, 2018, 272 : 542 - 557

← 1 2 3 4 5 →