HookScout: proactive binary-centric hook detection

  • Authors:
  • Heng Yin;Pongsin Poosankam;Steve Hanna;Dawn Song

  • Affiliations:
  • Syracuse University, Syracuse, NY;UC Berkeley, Berkeley, CA and Carnegie Mellon University, Pittsburgh, PA;UC Berkeley, Berkeley, CA;UC Berkeley, Berkeley, CA

  • Venue:
  • DIMVA'10 Proceedings of the 7th international conference on Detection of intrusions and malware, and vulnerability assessment
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In order to obtain and maintain control, kernel malware usually makes persistent control flow modifications (i.e., installing hooks). To avoid detection, malware developers have started to target function pointers in kernel data structures, especially those dynamically allocated from heaps and memory pools. Function pointer modification is stealthy and the attack surface is large; thus, this type of attacks is appealing to malware developers. In this paper, we first conduct a systematic study of this problem, and show that the attack surface is vast, with over 18, 000 function pointers (most of them long-lived) existing within the Windows kernel. Moreover, to demonstrate this threat is realistic for closed-source operating systems, we implement two new attacks for Windows by exploiting two function pointers individually. Then, we propose a new proactive hook detection technique, and develop a prototype, called HookScout. Our approach is binary-centric, and thus can generate hook detection policy without access to the OS kernel source code. Our approach is also context-sensitive, and thus can deal with polymorphic data structures. We evaluated HookScout with a set of rootkits which use advanced hooking techniques and show that it detects all of the stealth techniques utilized (including our new attacks). Additionally, we show that our approach is easily deployable, has wide coverage and minimal performance overhead.