Attack Tree Distance: a practical examination of tree difference measurement within cyber security

• URL: http://arxiv.org/abs/2503.02499v1
• Date: Tue, 04 Mar 2025 11:05:07 GMT
• Title: Attack Tree Distance: a practical examination of tree difference measurement within cyber security
• Authors: Nathan D. Schiele, Olga Gadyatskaya,
• Abstract summary: There is no established method to compare "real" attack trees.<n>We define four methods of comparison and compare them to a dataset of attack trees created from a study run on students.<n>We find that applying semantic similarity as a means of comparing node labels is a valid approach.
• Score: 0.3376269351435395
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: CONTEXT. Attack treesare a recommended threat modeling tool, but there is no established method to compare them. OBJECTIVE. We aim to establish a method to compare "real" attack trees, based on both the structure of the tree itself and the meaning of the node labels. METHOD. We define four methods of comparison (three novel and one established) and compare them to a dataset of attack trees created from a study run on students (n = 39). These attack trees all follow from the same scenario, but have slightly different labels. RESULTS. We find that applying semantic similarity as a means of comparing node labels is a valid approach. Further, we find that treeedit distance (established) and radical distance (novel) are themost promising methods of comparison in most circumstances. CONCLUSION. We show that these two methods are valid as means of comparing attack trees, and suggest a novel technique for using semantic similarity to compare node labels. We further suggest that these methods can be used to compare attack trees in a real-world scenario, and that they can be used to identify similar attack trees.

Related papers

• Boosting-Based Sequential Meta-Tree Ensemble Construction for Improved Decision Trees [1.8749305679160366]
  A decision tree is one of the most popular approaches in machine learning fields. A meta-tree is recently proposed to solve the problem of overfitting caused by overly deepened trees. The meta-tree guarantees statistical optimality based on Bayes decision theory.
  arXiv  Detail & Related papers  (2024-02-09T13:08:21Z)
• Automated generation of attack trees with optimal shape and labelling [0.9833293669382975]
  This article addresses the problem of automatically generating attack trees that soundly and clearly describe the ways the system can be attacked. We introduce an attack-tree generation algorithm that minimises the tree size and the information length of its labels without sacrificing correctness.
  arXiv  Detail & Related papers  (2023-11-22T11:52:51Z)
• Benchmarking Individual Tree Mapping with Sub-meter Imagery [6.907098367807166]
  We introduce an evaluation framework suited for individual tree mapping in any physical environment. We review and compare different approaches and deep architectures, and introduce a new method that we experimentally prove to be a good compromise between segmentation and detection.
  arXiv  Detail & Related papers  (2023-11-14T08:21:36Z)
• SoftTreeMax: Policy Gradient with Tree Search [72.9513807133171]
  We introduce SoftTreeMax, the first approach that integrates tree-search into policy gradient. On Atari, SoftTreeMax demonstrates up to 5x better performance in faster run-time compared with distributed PPO.
  arXiv  Detail & Related papers  (2022-09-28T09:55:47Z)
• Adversarial Example Detection in Deployed Tree Ensembles [25.204157642042627]
  We present a novel approach to detect adversarial examples in tree ensembles. Our approach works with any additive tree ensemble and does not require training a separate model. We empirically show that our method is currently the best adversarial detection method for tree ensembles.
  arXiv  Detail & Related papers  (2022-06-27T06:59:00Z)
• Attributable Visual Similarity Learning [90.69718495533144]
  This paper proposes an attributable visual similarity learning (AVSL) framework for a more accurate and explainable similarity measure between images. Motivated by the human semantic similarity cognition, we propose a generalized similarity learning paradigm to represent the similarity between two images with a graph. Experiments on the CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate significant improvements over existing deep similarity learning methods.
  arXiv  Detail & Related papers  (2022-03-28T17:35:31Z)
• Semantic-Preserving Adversarial Text Attacks [85.32186121859321]
  We propose a Bigram and Unigram based adaptive Semantic Preservation Optimization (BU-SPO) method to examine the vulnerability of deep models. Our method achieves the highest attack success rates and semantics rates by changing the smallest number of words compared with existing methods.
  arXiv  Detail & Related papers  (2021-08-23T09:05:18Z)
• An Efficient Adversarial Attack for Tree Ensembles [91.05779257472675]
  adversarial attacks on tree based ensembles such as gradient boosting decision trees (DTs) and random forests (RFs) We show that our method can be thousands of times faster than the previous mixed-integer linear programming (MILP) based approach. Our code is available at https://chong-z/tree-ensemble-attack.
  arXiv  Detail & Related papers  (2020-10-22T10:59:49Z)
• MurTree: Optimal Classification Trees via Dynamic Programming and Search [61.817059565926336]
  We present a novel algorithm for learning optimal classification trees based on dynamic programming and search. Our approach uses only a fraction of the time required by the state-of-the-art and can handle datasets with tens of thousands of instances.
  arXiv  Detail & Related papers  (2020-07-24T17:06:55Z)
• Exploiting Syntactic Structure for Better Language Modeling: A Syntactic Distance Approach [78.77265671634454]
  We make use of a multi-task objective, i.e., the models simultaneously predict words as well as ground truth parse trees in a form called "syntactic distances" Experimental results on the Penn Treebank and Chinese Treebank datasets show that when ground truth parse trees are provided as additional training signals, the model is able to achieve lower perplexity and induce trees with better quality.
  arXiv  Detail & Related papers  (2020-05-12T15:35:00Z)
• Tree! I am no Tree! I am a Low Dimensional Hyperbolic Embedding [7.381113319198104]
  We explore a new method for learning hyperbolic representations by taking a metric-first approach. Rather than determining the low-dimensional hyperbolic embedding directly, we learn a tree structure on the data. This tree structure can then be used directly to extract hierarchical information, embedded into a hyperbolic manifold.
  arXiv  Detail & Related papers  (2020-05-08T04:30:21Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.