Using Greedy Hamiltonian Call Paths to Detect Stack Smashing Attacks
- Cite this paper as:
- Foster M., Wilson J.N., Chen S. (2004) Using Greedy Hamiltonian Call Paths to Detect Stack Smashing Attacks. In: Zhang K., Zheng Y. (eds) Information Security. ISC 2004. Lecture Notes in Computer Science, vol 3225. Springer, Berlin, Heidelberg
The ICAT statistics over the past few years have shown at least one out of every five CVE and CVE candidate vulnerabilities have been due to buffer overflows. This constitutes a significant portion of today’s computer related security concerns. In this paper we introduce a novel method for detecting stack smashing and buffer overflow attacks. Our runtime method extracts return addresses from the program call stack and uses these return addresses to extract their corresponding invoked addresses from memory. We demonstrate how these return and invoked addresses can be represented as a directed weighted graph and used in the detection of stack smashing attacks. We introduce the concept of a Greedy Hamiltonian Call Path and show how the lack of such a path can be used to detect stack-smashing attacks.
Unable to display preview. Download preview PDF.