Unearthing stealthy program attacks buried in extremely long execution paths

56Citations
Citations of this article
102Readers
Mendeley users who have this article in their library.

Abstract

Modern stealthy exploits can achieve attack goals without introducing illegal control flows, e.g., tampering with noncontrol data and waiting for the modified data to propagate and alter the control flow legally. Existing program anomaly detection systems focusing on legal control flow attestation and short call sequence verification are inadequate to detect such stealthy attacks. In this paper, we point out the need to analyze program execution paths and discover event correlations in large-scale execution windows among millions of instructions. We propose an anomaly detection approach with two-stage machine learning algorithms to recognize diverse normal call-correlation patterns and detect program attacks at both inter-and intra-cluster levels. We implement a prototype of our approach and demonstrate its effectiveness against three real-world attacks and four synthetic anomalies with less than 0.01% false positive rates and 0.1~1.3 ms analysis overhead per behavior instance (1k to 50k function or system calls).

Cite

CITATION STYLE

APA

Shu, X., Yao, D., & Ramakrishnan, N. (2015). Unearthing stealthy program attacks buried in extremely long execution paths. In Proceedings of the ACM Conference on Computer and Communications Security (Vol. 2015-October, pp. 401–413). Association for Computing Machinery. https://doi.org/10.1145/2810103.2813654

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