Retraction Notice: A Metric for Measuring Distances Between Attack Trees in Cybersecurity

In this paper, we explore a novel problem in cybersecurity: determining the distance between two attack trees. Attack trees, as initially described by Bruce Schneier, are rooted acyclic structures that model the various ways an attack can occur. We define attack trees using a formal recursive structure and propose a method to measure the distance between them. Our primary research goal is to establish a mechanism for calculating this distance, which can enhance threat modeling by allowing practitioners to compare and share attack trees more effectively. We outline the theoretical and usability requirements for our distance measure, ensuring it meets the criteria of being a metric, accommodating noisy human-developed labels, and incorporating all aspects of the trees. The common structure for sharing attack trees is defined by the ADTool XML Schema, while the means of comparison is developed through our proposed distance measure. This method can potentially identify similar threats, highlight missing components in analyses, and facilitate comparisons between human-drawn and machine-generated attack trees. Our approach aims to make threat modeling more robust and collaborative, providing practitioners with a valuable tool for threat analysis.

Authors

Institutions

Publication Details

Published
2025-02-05
DOI
https://doi.org/10.1109/icaic63015.2025.11049957
Primary Topic
Network Security and Intrusion Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Retraction Notice: A Metric for Measuring Distances Between Attack Trees in Cybersecurity

Rohit Raja
Network Security and Intrusion Detection
article

Retraction Notice: A Metric for Measuring Distances Between Attack Trees in Cybersecurity

Rohit Raja
article en

Abstract

In this paper, we explore a novel problem in cybersecurity: determining the distance between two attack trees. Attack trees, as initially described by Bruce Schneier, are rooted acyclic structures that model the various ways an attack can occur. We define attack trees using a formal recursive structure and propose a method to measure the distance between them. Our primary research goal is to establish a mechanism for calculating this distance, which can enhance threat modeling by allowing practitioners to compare and share attack trees more effectively. We outline the theoretical and usability requirements for our distance measure, ensuring it meets the criteria of being a metric, accommodating noisy human-developed labels, and incorporating all aspects of the trees. The common structure for sharing attack trees is defined by the ADTool XML Schema, while the means of comparison is developed through our proposed distance measure. This method can potentially identify similar threats, highlight missing components in analyses, and facilitate comparisons between human-drawn and machine-generated attack trees. Our approach aims to make threat modeling more robust and collaborative, providing practitioners with a valuable tool for threat analysis.

University of Bridgeport (US)
Openalex Percentile: Top 84%
Network Security and Intrusion Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Retraction Notice: A Metric for Measuring Distances Between Attack Trees in Cybersecurity — Rohit Raja · (2025) | TGRS Research Map | TGRS