2005 IEEE Symposium on Security and Privacy (S&P'05) (2005)
May 8, 2005 to May 11, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SP.2005.1
Rajeev Gopalakrishna , Purdue University
Eugene H. Spafford , Purdue University
Jan Vitek , Purdue University
Host-based intrusion detection systems attempt to identify attacks by discovering program behaviors that deviate from expected patterns. While the idea of performing behavior validation on-the-fly and terminating errant tasks as soon as a violation is detected is appealing, existing systems exhibit serious shortcomings in terms of accuracy and/or efficiency. To gain acceptance, a number of technical advances are needed. In this paper we focus on automated, conservative, intrusion detection techniques, i.e. techniques which do not require human intervention and do not suffer from false positives.<div></div> We present a static analysis algorithm for constructing a flow- and context-sensitive model of a program that allows for efficient online validation. Context-sensitivity is essential to reduce the number of impossible control-flow paths accepted by the intrusion detection system because such paths provide opportunities for attackers to evade detection. An important consideration for on-the-fly intrusion detection is to reduce the performance overhead caused by monitoring. Compared to the existing approaches, our inlined automaton model (IAM) presents a good tradeoff between accuracy and performance. On a 32K line program, the monitoring overhead is negligible. While the space requirements of a naive IAM implementation can be quite high, compaction techniques can be employed to substantially reduce that footprint.
R. Gopalakrishna, J. Vitek and E. H. Spafford, "Efficient Intrusion Detection using Automaton Inlining," 2005 IEEE Symposium on Security and Privacy (S&P'05)(SP), Oakland, California, 2005, pp. 18-31.