Abstract
The (Single-Path Attack Graph Algorithm) chapter contributes an algorithm and a PoC implementation for generating single-path attack graphs for an entire system.
The best security strategies are those that take into account the entire system, not just individual components.
– Bruce Schneier
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Single-path attack graphs are also called attack trees or attack forests, depending on the number of root nodes.
- 2.
Auguste Kerckhoffs (1835 till 1903) was a Dutch cryptologist today famous for the Kerckhoffs principle.
- 3.
The monotonicity property would not hold in fast-changing domains, e.g., enterprise networks with many mobile and daily changing participants.
- 4.
The resulting graph is not a Bayesian network as the resulting graph nodes consider pre-predecessor’s statuses.
- 5.
JMH (Java Microbenchmark Harness) was founded in 2013, was still in its first year at the time of the benchmark implementation, and was not included in the JDK until 2019.
- 6.
Google Caliper was only in its second year at the time of the benchmark implementation.
- 7.
JUnitBenchmarks appeared dead and was officially declared “deprecated” one year later 2015, explicitly in favor of JMH.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Fachmedien Wiesbaden GmbH, part of Springer Nature
About this chapter
Cite this chapter
Salfer, M. (2024). Single-Path Attack Graph Algorithm. In: Automotive Security Analyzer for Exploitability Risks. Springer Vieweg, Wiesbaden. https://doi.org/10.1007/978-3-658-43506-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-658-43506-6_4
Published:
Publisher Name: Springer Vieweg, Wiesbaden
Print ISBN: 978-3-658-43505-9
Online ISBN: 978-3-658-43506-6
eBook Packages: Computer Science and Engineering (German Language)