Anomaly detection using call stack information

By Henry Hanping Feng, Oleg M. Kolesnikov, Prahlad Fogla, Wenke Lee, W. Gong. 2003 Symposium on Security and Privacy, 2003., 2003

443 citations recorded by the source corpus.

The call stack of a program execution can be a very good information source for intrusion detection. There is no prior work on dynamically extracting information from the call stack and effectively using it to detect exploits. In this paper we propose a new method to do anomaly detection using call stack information. The basic idea is to extract return addresses from the call stack, and generate an abstract execution path between two program execution points. Experiments show that our method can detect some attacks that cannot be detected by other approaches, while its convergence and false positive performance is comparable to or better than the other approaches. We compare our method with other approaches by analyzing their underlying principles and thus achieve a better characterization of their performance, in particular on what and why attacks will be missed by the various approaches.

Subfields: Computer Networks and Communications, Signal Processing

View Paper: https://www.semanticscholar.org/paper/c02cca40eb3f7af976f8c77007ded81d72592013

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Adam Bates
  2. Wajih Ul Hassan
  3. Margo I. Seltzer
  4. Thomas Pasquier
  5. Xueyuan Han
  6. James W. Mickens
  7. Kang G. Shin
  8. R. Sekar

In Signal Processing

  1. Adam Bates
  2. Wajih Ul Hassan
  3. Roman V Yampolskiy
  4. Venugopal Govindaraju
  5. Margo I. Seltzer
  6. Thomas Pasquier
  7. Xueyuan Han
  8. James W. Mickens

Citations in the corpus