| 基于蚁群算法的攻击图分析 |
| |
| 引用本文： | 黄超,周宁,倪佑生.基于蚁群算法的攻击图分析[J].计算机工程,2009,35(18):133-135. |
| |
| 作者姓名： | 黄超 周宁 倪佑生 |
| |
| 作者单位： | 上海交通大学信息安全工程学院,上海,200240 |
| |
| 基金项目： | 国家自然科学基金资助项目 |
| |
| 摘 要： | 分析攻击图分析中求解攻击图最小关键集的方法和作用。在研究蚁群算法的基础上，将其引入对攻击图的最小关键集的求解中，对Cincotti等人提出的针对权值最小碰集问题的蚁群算法进行改进，并用实验验证了算法的可行性。
|
| 关 键 词： | 最小关键集 蚁群算法 漏洞评级 |
| 修稿时间： | |
Attack Graphs Analysis Based on Ant Algorithm |
| |
| HUANG Chao,ZHOU Ning,NI You-sheng.Attack Graphs Analysis Based on Ant Algorithm[J].Computer Engineering,2009,35(18):133-135. |
| |
| Authors: | HUANG Chao ZHOU Ning NI You-sheng |
| |
| Affiliation: | Department of Information Security Engineering;Shanghai Jiaotong University;Shanghai 200240 |
| |
| 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. |
| |
| Keywords: | minimum critical set ant colony algorithm vulnerability scoring |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
