摘要： 分析攻击图分析中求解攻击图最小关键集的方法和作用。在研究蚁群算法的基础上，将其引入对攻击图的最小关键集的求解中，对Cincotti等人提出的针对权值最小碰集问题的蚁群算法进行改进，并用实验验证了算法的可行性。

关键词: 最小关键集, 蚁群算法, 漏洞评级

Abstract: The minimum critical set is the most important information that network attack graph shows. If all the vulnerabilities in the set are fixed, the whole network will become safe. After researching and analyzing ant algorithm, the paper tries to use ant colony algorithm to resolve the minimum critical set problem in network attack graphs and enhance the algorithm which is put forward by Cincotti. Experiment validates the algorithm.

Key words: minimum critical set, ant colony algorithm, vulnerability scoring

中图分类号: 

• TP393