Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

34

ISPEC
2010
Springer

favoriteEmaildiscussreport

293views Security Privacy» more ISPEC 2010»

On Fast and Approximate Attack Tree Computations

14 years 2 months ago

On Fast and Approximate Attack Tree Computations

Download research.cyber.ee

Abstract. In this paper we address the problem of ineﬃciency 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 conﬁdence 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.

Aivo Jürgenson, Jan Willemson

Real-time Traffic

Attack Tree Computations | Attack Trees | Fast Approximate Computations | ISPEC 2010 | Security Privacy |

claim paper

Related Content

» Metric tree partitioning and Taylor approximation for fast support vector classification

» A fast algorithm for computing steiner edge connectivity

» Nonparametric Density Estimation on A Graph Learning Framework Fast Approximation and Appl...

» A Practical Method to Counteract Denial of Service Attacks

» Hierarchical Convex Approximation of 3D Shapes for Fast Region Selection

» Fast heuristics for the Steiner tree problem with revenues budget and hop constraints

» DDoS Detection and Traceback with Decision Tree and Grey Relational Analysis

» Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions

» Fast Kalman filtering on quasilinear dendritic trees

Post Info
More Details (n/a)

Added	09 Jul 2010
Updated	09 Jul 2010
Type	Conference
Year	2010
Where	ISPEC
Authors	Aivo Jürgenson, Jan Willemson

Comments (0)