Abstract: The calculation of risk probability in the attack graph lacks cycles nodes processing. In order to sovle this problem, this paper proposes a nodes risk probability algorithm in attack graph with cycles. It gives examples of the attack graph with cycles, and introduces the risk probability calculating method with cycles or no cycles. It gives the not retrospective hypothesis to make sure the cycle path, and breaks the cycles through removing the export edge of the nodes in the cycles, and unreachable nodes. Experimental results show that this algorithm can obtain accurate calculation results, and its time complexity is low.

Key words: attack graph, target node, risk probability, cycling path

摘要： 在攻击图的风险概率计算中，没有针对环路节点的处理。为此，提出一种有环攻击图中的节点风险概率算法。给出带有环路的攻击图示例，介绍有环、无环节点风险概率的计算方法。根据不回溯性假设，确定循环路径，通过移除节点在环路中的出口边及不可达节点打破环路。实验结果表明，该算法能获得较精确的计算结果，且时间复杂度较低。

关键词: 攻击图, 目标节点, 风险概率, 循环路径

CLC Number: 

• TP301.6