DocumentCode :
2136266
Title :
Generation of attack scenarios by modeling algorithms for evaluating IDS
Author :
Saber, Mohammed ; Bouchentouf, Toumi ; Benazzi, Abdelhamid
Author_Institution :
Dept. of Comput. Sci., Mohammed First Univ., Oujda, Morocco
fYear :
2011
fDate :
7-9 April 2011
Firstpage :
1
Lastpage :
5
Abstract :
We will focus in this paper to improve the level of intrusion detection system (IDS). This improvement is based on three research areas: classification of attacks, generation of attack scenarios and finally evaluation methods. We will discuss in this article the second area, which consists on the research of meaningful scenarios in order to minimize false and positive alerts reported by an IDS. We will present two algorithms generating these scenarios. The first one allows the conversion of the problem to a constraint programming problem (CSP) and the second one is based on an algorithm to search the shortest path. We will also compare the results of these two algorithms.
Keywords :
constraint handling; graph theory; security of data; attack classification; attack scenario generation; constraint programming problem; false alert; intrusion detection system; modeling algorithm; positive alert; shortest path algorithm; Computational modeling; Computer crime; Conferences; Java; Libraries; Malware; USA Councils; Attack; CHOCO; CSP; Evaluation; IDS; Scenario;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Multimedia Computing and Systems (ICMCS), 2011 International Conference on
Conference_Location :
Ouarzazate
ISSN :
Pending
Print_ISBN :
978-1-61284-730-6
Type :
conf
DOI :
10.1109/ICMCS.2011.5945730
Filename :
5945730
Link To Document :
بازگشت