Answers are grounded in this paper and cite their sources.
Demonstrates improved forensic analysis accuracy in network investigations, indicating enhanced efficiency for investigators.
In this paper, we describe an efficient methodology to guide investigators during network forensic analysis. To this end, we introduce the concept of core attack graph, a compact representation of the main routes an attacker can take towards specific network targets. Such compactness allows forensic investigators to focus their efforts on critical nodes that are more likely to be part of attack paths, thus reducing the overall number of nodes (devices, network privileges) that need to be examined. Nevertheless, core graphs also allow investigators to hierarchically explore the graph in order to retrieve different levels of summarised information. We have evaluated our approach over different network topologies varying parameters such as network size, density, and forensic evaluation threshold. Our results demonstrate that we can achieve the same level of accuracy provided by standard logical attack graphs while significantly reducing the exploration rate of the network.
No takes yet. Share an insight, caveat, or question.
Barrère et al. (2017) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: