论文标题
一个自动化的端到端框架,用于对漏洞描述进行建模攻击
An Automated, End-to-End Framework for Modeling Attacks From Vulnerability Descriptions
论文作者
论文摘要
攻击图是用于自动化风险评估过程的主要技术之一。为了得出相关的攻击图,有关已知攻击技术的最新信息应表示为交互规则。设计和创建新的交互规则并不是一项琐碎的任务,目前由安全专家手动执行。但是,由于新的安全漏洞和攻击技术的数量不断增长,因此有必要经常使用新的攻击技术更新规则集的攻击图工具集,以确保一组交互规则始终是最新的。我们提出了一个新颖的,端到端的自动化框架,用于从安全漏洞的文本描述中对新攻击技术进行建模。鉴于对安全漏洞的描述,提出的框架首先提取建模攻击所需的相关攻击实体,完成有关漏洞的丢失信息,并得出对攻击进行建模的新交互规则;该新规则集成在Mulval攻击图工具中。所提出的框架实现了一条新型管道,其中包括在NVD存储库中训练的专用网络安全语言模型,用于攻击实体提取的复发性神经网络模型,用于完成缺失信息的逻辑回归模型,以及一种新型的机器学习方法,用于自动将攻击作为MULVAL的交互规则,以自动建模攻击。我们评估了每种算法的性能以及完整的框架,并证明了其有效性。
Attack graphs are one of the main techniques used to automate the risk assessment process. In order to derive a relevant attack graph, up-to-date information on known attack techniques should be represented as interaction rules. Designing and creating new interaction rules is not a trivial task and currently performed manually by security experts. However, since the number of new security vulnerabilities and attack techniques continuously and rapidly grows, there is a need to frequently update the rule set of attack graph tools with new attack techniques to ensure that the set of interaction rules is always up-to-date. We present a novel, end-to-end, automated framework for modeling new attack techniques from textual description of a security vulnerability. Given a description of a security vulnerability, the proposed framework first extracts the relevant attack entities required to model the attack, completes missing information on the vulnerability, and derives a new interaction rule that models the attack; this new rule is integrated within MulVAL attack graph tool. The proposed framework implements a novel pipeline that includes a dedicated cybersecurity linguistic model trained on the the NVD repository, a recurrent neural network model used for attack entity extraction, a logistic regression model used for completing the missing information, and a novel machine learning-based approach for automatically modeling the attacks as MulVAL's interaction rule. We evaluated the performance of each of the individual algorithms, as well as the complete framework and demonstrated its effectiveness.