收稿日期: 2011-07-21
修回日期: 2011-10-10
网络出版日期: 2012-07-25
基金资助
国家自然科学基金(No.61003285)；国家发改委信息安全专项基金；教育部科学技术研究重点项目基金；中央高校基本科研业务
费专项资金(No.BUPT2009RC0215)资助
Finding Key Host of Network through Iterative Matrix
Received date: 2011-07-21
Revised date: 2011-10-10
Online published: 2012-07-25
钟尚勤1;2， 刘福强3， 徐国胜1;2， 杨榆1;2, 姚文斌1;2 . 利用迭代矩阵寻找网络中的关键主机[J]. 应用科学学报, 2012 , 30(4) : 374 -378 . DOI: 10.3969/j.issn.0255-8297.2012.04.008
Security of the key host is of prime importance to the overall network, but locating the key host
difficult. This paper gives a definition of key hosts, provides their classification, and propose an approach to
finding the key hosts. The method uses the host-based attack graph and the theory of iterative matrix. By
computing and sorting the security properties of each host, the network security administrator can identify
key hosts and the corresponding key critical-conditions. Appropriate measures can then be taken to protect
the key hosts and enhance the overall network security. Experiment shows that this approach can be applied
to the analysis of network security, and is useful for the enhancement of network security.
Key words： key host; host-based attack graph; iterative matrix; network security
/
| 〈 |
|
〉 |
