Structural detection of android malware using embedded call graphs

  • Authors:
  • Hugo Gascon;Fabian Yamaguchi;Daniel Arp;Konrad Rieck

  • Affiliations:
  • University of Göttingen, Göttingen, Germany;University of Göttingen, Göttingen, Germany;University of Göttingen, Göttingen, Germany;University of Göttingen, Göttingen, Germany

  • Venue:
  • Proceedings of the 2013 ACM workshop on Artificial intelligence and security
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

Abstract

The number of malicious applications targeting the Android system has literally exploded in recent years. While the security community, well aware of this fact, has proposed several methods for detection of Android malware, most of these are based on permission and API usage or the identification of expert features. Unfortunately, many of these approaches are susceptible to instruction level obfuscation techniques. Previous research on classic desktop malware has shown that some high level characteristics of the code, such as function call graphs, can be used to find similarities between samples while being more robust against certain obfuscation strategies. However, the identification of similarities in graphs is a non-trivial problem whose complexity hinders the use of these features for malware detection. In this paper, we explore how recent developments in machine learning classification of graphs can be efficiently applied to this problem. We propose a method for malware detection based on efficient embeddings of function call graphs with an explicit feature map inspired by a linear-time graph kernel. In an evaluation with 12,158 malware samples our method, purely based on structural features, outperforms several related approaches and detects 89% of the malware with few false alarms, while also allowing to pin-point malicious code structures within Android applications.