arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.13331cs.CRcs.FL
收藏

具有最优形状与标注的攻击树自动生成方法

Automated generation of attack trees with optimal shape and labelling

Olga Gadyatskaya, Sjouke Mauw, Rolando Trujillo-Rasuac, Tim A. C. Willemse

AI总结:

针对攻击树自动生成的合理性与清晰性需求,提出结合系统模型与代数因式分解关联的算法,在保证正确性的同时优化树的形状与标注,为首款具备该特性的生成框架。

摘要:

本文研究可合理、清晰描述系统受攻击方式的攻击树自动生成问题。合理性指攻击树展示的攻击确实是系统中的真实攻击;清晰性指树在传达攻击场景方面具备高效性。为实现清晰性,本文提出一种攻击树生成算法,可在不牺牲正确性的前提下最小化树的规模及其标注的信息长度。我们通过两点实现该目标:一是提出一种可高效推理攻击与目标的系统模型,二是建立代数表达式因式分解问题与树规模最小化问题之间的关联。据我们所知,本文提出的是首个可优化生成树的标注与形状,同时保证其相对于系统规范合理性的攻击树生成框架。

英文摘要:

This article addresses the problem of automatically generating attack trees that soundly and clearly describe the ways the system can be attacked. Soundness means that the attacks displayed by the attack tree are indeed attacks in the system; clarity means that the tree is efficient in communicating the attack scenario. To pursue clarity, we introduce an attack-tree generation algorithm that minimises the tree size and the information length of its labels without sacrificing correctness. We achieve this by i) introducing a system model that allows to reason about attacks and goals in an efficient manner, and ii) by establishing a connection between the problem of factorising algebraic expressions and the problem of minimising the tree size. To the best of our knowledge, we introduce the first attack-tree generation framework that optimises the labelling and shape of the generated trees, while guaranteeing their soundness with respect to a system specification.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑