Computer Network Attack Modeling and Network Attack Graph Study

Article Preview

Abstract:

With the development of computer network and rapid popularity of Internet, network information security has become the focus of safeguarding national security and social stability. In the network security event, the hacker often can’t successfully intrude into the network by means of a single host / services hacker. With the help of various kinds of "vulnerability" generated bydifferent relationship existing in multiple point multiple host, the hacker can achieve the purpose of network intrusion. Therefore one important aspect of network security is after obtaining the vulnerability of the network information, considering a combination of multiple exploits and analyzing the attack path of network penetration attacks that the attacker may take.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 1079-1080)

Pages:

816-819

Citation:

Online since:

December 2014

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2015 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] G.H. Kim, E.H. Spaford. Experiences with Trip wire: Using Integrity Checkers for Intrusion Detection. Purdue Technical Report CSD- TR- 93- 071. Department of Computer Sciences, Purdue University, (1994).

Google Scholar

[2] L. P. Swiler, C. Phillips, D. Ellis, and S. Chakerian. Computer- attack graph generation tool. In DARPA Information Sur vivability Conference and Exposition(DISCEX II' 01), volume 2, June (2001).

DOI: 10.1109/discex.2001.932182

Google Scholar

[3] Cynthia Phillips and Laura PaintonSwiler. A graph - based system for networkvulnerability analysis. In NSPW ' 98: Proceedings of the 1998 workshop on Newsecurity paradigms, pages 71– 79. ACM Press, (1998).

Google Scholar

[4] Patrice Godefroid. Model checking for programming languages using version. In Proceedings of the 24th ACM SIGPLAN - SIGACT symposium on Principles of programming languages , pages 174 – 186, Paris, France, (1997).

DOI: 10.1145/263699.263717

Google Scholar