Correlating alerts into compressed graphs using an attribute-based method and time windows

1Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Intrusion Detection Systems usually report a huge number of alerts every day. Since abstraction level of these alerts is very low, analyzing and discovering the attack strategies behind the alerts are not easy or even possible. Alert correlation methods have been developed to decrease the number of alerts and provide a high-level abstraction of them. In this paper, we propose a method to estimate correlation probabilities between alerts. The concept of time windows is applied in a special way to decrease the complexity and increase the accuracy as well. Besides, we suggest a compression method for more reduction in the number of comparisons needed for correlating alerts and making the output of the method more intelligible. Our experiments reveal while the proposed correlation method performs accurately, its complexity dropped noticeably compared to previous methods. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ahmadinejad, S. H., & Jalili, S. (2009). Correlating alerts into compressed graphs using an attribute-based method and time windows. In Communications in Computer and Information Science (Vol. 58, pp. 18–25). https://doi.org/10.1007/978-3-642-10847-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free