中文

Journal of Applied Sciences ›› 2012, Vol. 30 ›› Issue (4): 374-378.doi: 10.3969/j.issn.0255-8297.2012.04.008

• Computer Science and Applications • Previous Articles     Next Articles

Finding Key Host of Network through Iterative Matrix

ZHONG Shang-qin1;2, LIU Fu-qiang3, XU Guo-sheng1;2, YANG Yu1;2, YAO Wen-bin1;2   

  1. 1. Information Security Center, Beijing University of Posts and Telecommunications, Beijing 100876, China
    2. National Engineering Laboratory for Disaster Backup and Recovery, Beijing University of Posts and
    Telecommunications, Beijing 100876, China
    3. Naval Academy of Armament, Beijing 100036, China
  • Received:2011-07-21 Revised:2011-10-10 Online:2012-07-23 Published:2012-07-25

PDF

886

Abstract:

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

CLC Number: