Sign in
Author

Conference

Journal

Organization

Year

DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all fields of study
Limit my searches in the following fields of study
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(3)
Decision Making Process
Directed Acyclic Graph
Efficient Algorithm
Subscribe
Academic
Publications
Serial Model for Attack Tree Computations
Serial Model for Attack Tree Computations,10.1007/9783642144233_9,Aivo Jürgenson,Jan Willemson
Edit
Serial Model for Attack Tree Computations
(
Citations: 4
)
BibTex

RIS

RefWorks
Download
Aivo Jürgenson
,
Jan Willemson
Abstract In this paper we extend the standard attack tree model by intro ducing temporal order to the attacker’s
decision making
process. This will allow us to model the attacker’s behaviour more accurately, since this way it is possible to study his actions related to dropping some of the elementary attacks due to them becoming obsolete based on the previous success/failure results. We propose an
efficient algorithm
for computing the attacker’s expected outcome based on the given order of the elementary attacks and discuss the pros and cons of consider ing general rooted directed acyclic graphs instead of plain trees as the
Conference:
Information Security and Cryptology  ICISC
, pp. 118128, 2009
DOI:
10.1007/9783642144233_9
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
www.springerlink.com
)
(
www.springerlink.com
)
(
research.cyber.ee
)
(
www.informatik.unitrier.de
)
(
dx.doi.org
)
More »
Citation Context
(3)
...Consequently, our formalism provides a single framework covering the attributes and semantics of attack trees used in [
4
,5,6], including the notion of defense trees from [7,8]...
...Willemson and Jürgenson [
4
] have extended the attack trees framework by introducing an order on the set of leaves which helps to solve the optimization problem of selecting the best attack given an attack tree...
...Several different approaches, like propositional logics or multiset interpretations, were proposed in the literature to define semantics for attack trees [
4
,16,3]...
...Propositional Model. The most commonly used model for attack trees is based on propositional logic, cf. [
4
,16]...
...This general framework unifies different approaches [3,
4
,5] to attack trees that have been proposed in the literature, because they all rely upon an underlying equivalence relation...
Barbara Kordy
,
et al.
Foundations of AttackDefense Trees
...As a consequence, formal analysis techniques were designed [
3
,4] and computer tools were made commercially available [5,6]...
Barbara Kordy
,
et al.
AttackDefense Trees and TwoPlayer Binary ZeroSum Extensive Form Ga...
...J¨ urgenson and Willemson went on to consider a model of serial attacks [
15
] in which the adversary performs the attacks in a prescribed order and has full information about what the results of the previous attacks are...
...This was the intuition behind the model of J¨ urgenson and Willemson [
15
]...
...ordering for the elementary attacks in X .D enote byOutcome JW the expected utility assigned to the attack tree with attack order σ on the optimal subset of X by the serial mode of Jurgenson and Willemson [
15
] and let Outcome DT be the expected utility computed by the decisiontheoretic model proposed in this paper...
...J¨ urgenson and Willemson [
15
] showed that...
...Following the steps of the previous section, it is trivial to see that our model of economic decision trees actually reduces to the form where we have a directed 6 This follows from the fact that there is always just one consequential decision compound for each elementary attack Xi from which it follows that the optimal subset for the model of [
15
] is exactly the set of elementary attacks Xi that are considered worthwhile in our model...
Margus Niitsoo
.
Optimal Adversary Behavior for the Serial Model of Financial Attack Tr...
References
(10)
An attack tree for the border gateway protocol
(
Citations: 27
)
S. Convery
,
D. Cook
,
M. Franz
Published in 2004.
Foundations of Attack Trees
(
Citations: 55
)
Sjouke Mauw
,
Martijn Oostdijk
Conference:
Information Security and Cryptology  ICISC
, pp. 186198, 2005
Attack Modeling for Information Security and Survivability
(
Citations: 82
)
Andrew P. Moore
,
Robert J. Ellison
,
Richard C. Linger
Published in 2001.
Attack trees  modeling security threats
(
Citations: 213
)
B. Schneier
Published in 1999.
Building secure software: how to avoid security problems the right way
(
Citations: 227
)
John Viega
,
Gary Mcgraw
Published in 2002.
Sort by:
Citations
(4)
Foundations of AttackDefense Trees
(
Citations: 1
)
Barbara Kordy
,
Sjouke Mauw
,
Sasa Radomirovic
,
Patrick Schweitzer
Conference:
Workshop on Issues in the Theory of Security  WITS
, pp. 8095, 2010
AttackDefense Trees and TwoPlayer Binary ZeroSum Extensive Form Games Are Equivalent
(
Citations: 1
)
Barbara Kordy
,
Sjouke Mauw
,
Matthijs Melissen
,
Patrick Schweitzer
Journal:
Computing Research Repository  CORR
, vol. abs/1006.2, pp. 245256, 2010
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
(
Citations: 1
)
Margus Niitsoo
Conference:
International Workshop on Security  IWSEC
, pp. 354370, 2010
On Fast and Approximate Attack Tree Computations
Aivo Jürgenson
,
Jan Willemson
Conference:
Information Security Practice and Experience  ISPEC
, pp. 5666, 2010