Ecole d'ingénieur et centre de recherche en Sciences du numérique

Using loops for malware classification resilient to feature-unaware perturbations

Machiry, Aravind; Redini, Nilo; Gustafson, Eric; Fratantonio, Yanick; Ryn Choe, Yung; Kruegel, Christopher; Vigna, Giovanni

ACSAC 2018, 34th Annual Computer Security Applications Conference, 3-7 December 2018, San Juan, Puerto Rico, USA

In the past few years, both the industry and the academic communities have developed several approaches to detect malicious Android apps. State-of-the-art research approaches achieve very high accuracy when performing malware detection on existing datasets. These approaches perform their malware classification tasks in an "offline" scenario, where malware authors cannot learn from and adapt their malicious apps to these systems. In real-world deployments, however, adversaries get feedback about whether their app was detected, and can react accordingly by transforming their code until they are able to influence the classification. In this work, we propose a new approach for detecting Android malware that is designed to be resilient to feature-unaware perturbations without retraining. Our work builds on two key ideas. First, we consider only a subset of the codebase of a given app, both for precision and performance aspects. For this paper, our implementation focuses exclusively on the loops contained in a given app. We hypothesize, and empirically verify, that the code contained in apps' loops is enough to precisely detect malware. This provides the additional benefits of being less prone to noise and errors, and being more performant. The second idea is to build a feature space by extracting a set of labels for each loop, and by then considering each unique combination of these labels as a different feature: The combinatorial nature of this feature space makes it prohibitively difficult for an attacker to influence our feature vector and avoid detection, without access to the specific model used for classification. We assembled these techniques into a prototype, called LoopMC, which can locate loops in applications, extract features, and perform classification, without requiring source code. We used LoopMC to classify about 20,000 benign and malicious applications. While focusing on a smaller portion of the program may seem counterintuitive, the results of these experiments are surprising: our system achieves a classification accuracy of 99.3% and 99.1% for the Malware Genome Project and VirusShare datasets respectively, which outperforms previous approaches. We also evaluated LoopMC, along with the related work, in the context of various evasion techniques, and show that our system is more resilient to evasion.

Document Doi Bibtex

Titre:Using loops for malware classification resilient to feature-unaware perturbations
Type:Conférence
Langue:English
Ville:San Juan
Pays:ÉTATS-UNIS
Date:
Département:Sécurité numérique
Eurecom ref:5699
Copyright: © ACM, 2018. This is the author's version of the work. It is posted here by permission of ACM for your personal use. Not for redistribution. The definitive version was published in ACSAC 2018, 34th Annual Computer Security Applications Conference, 3-7 December 2018, San Juan, Puerto Rico, USA http://dx.doi.org/10.1145/3274694.3274731
Bibtex: @inproceedings{EURECOM+5699, doi = {http://dx.doi.org/10.1145/3274694.3274731}, year = {2018}, title = {{U}sing loops for malware classification resilient to feature-unaware perturbations}, author = {{M}achiry, {A}ravind and {R}edini, {N}ilo and {G}ustafson, {E}ric and {F}ratantonio, {Y}anick and {R}yn {C}hoe, {Y}ung and {K}ruegel, {C}hristopher and {V}igna, {G}iovanni}, booktitle = {{ACSAC} 2018, 34th {A}nnual {C}omputer {S}ecurity {A}pplications {C}onference, 3-7 {D}ecember 2018, {S}an {J}uan, {P}uerto {R}ico, {USA}}, address = {{S}an {J}uan, {\'{E}}{TATS}-{UNIS}}, month = {12}, url = {http://www.eurecom.fr/publication/5699} }
Voir aussi: