DocumentCode :
2804207
Title :
A scalable representation towards attack graph generation
Author :
Bhattacharya, Somak ; Malhotra, Samresh ; Ghsoh, S.K.
Author_Institution :
Indian Inst. of Technol., Kharagpur
fYear :
2008
fDate :
18-21 May 2008
Firstpage :
1
Lastpage :
4
Abstract :
In todaypsilas large complex organizational network, security administration is a challenging task. The typical means by which an attacker breaks into a network is through a series of exploits, where each exploit in the series satisfies the pre-condition for subsequent exploits and makes a causal relationship among them. Such a series of exploit is called attack path and the set of all possible attack paths form an attack graph. However, the generated attack graphs by various previous approaches become too complicated to visually interpret and comprehend. Hence the proposed approach addresses the scalability issue of the attack graph generation through a generic attack path detection algorithm. This will reduce the generation of redundancy in attack graph, thus facilitating security management of an enterprise network.
Keywords :
graph theory; intranets; security of data; telecommunication security; attack graph generation; attack path detection algorithm; causal relationship; enterprise network security management; organizational network; security administration; Abstracts; Algorithm design and analysis; Binary decision diagrams; Computer network management; Computer networks; Detection algorithms; Information security; Information technology; Risk management; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology, 2008. IT 2008. 1st International Conference on
Conference_Location :
Gdansk
Print_ISBN :
978-1-4244-2244-9
Electronic_ISBN :
978-1-4244-2245-6
Type :
conf
DOI :
10.1109/INFTECH.2008.4621611
Filename :
4621611
Link To Document :
بازگشت