Skip to content

Malware mutation via Monte Carlo Tree Search to analyze the performance of malware classifiers based on Machine Learning models.

Notifications You must be signed in to change notification settings

UMBC-DREAM-Lab/montemutacon

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

18 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

MonteMutacon

This repository contains the code for the mutant malware feature discovery with Monte Carlo Tree Search (MCTS). This method is based on our paper "Evading Malware Classifiers via Monte Carlo Mutant Feature Discovery" that was presented at the 12th Annual Malware Technical Exchange Meeting. Both MCTS and Random Search are included in the repository; however, the repository does not contain any of the performance evaluation code used in our research.

The use of Machine Learning has become a significant part of malware detection efforts due to the influx of new malware, an ever changing threat landscape, and the ability of Machine Learning methods to discover meaningful distinctions between malicious and benign software. Antivirus vendors have also begun to widely utilize malware classifiers based on dynamic and static malware analysis features. Therefore, a malware author might make evasive binary modifications against Machine Learning models as part of the malware development life cycle to execute an attack successfully. This makes the studying of possible classifier evasion strategies an essential part of cyber defense against malice. To this extent, we stage a grey box setup to analyze a scenario where the malware author does not know the target classifier algorithm, and does not have access to decisions made by the classifier, but knows the features used in training. In this experiment, a malicious actor trains a surrogate model using the EMBER-2018 dataset to discover binary mutations that cause an instance to be misclassified via a Monte Carlo tree search. Then, mutated malware is sent to the victim model that takes the place of an antivirus API to test whether it can evade detection.

Our results show that MCTS finds successful mutations on the surrogate model for 52.18% of the malware, out of which 8.78% evades detection by the victim model, performing slightly better than our random mutation baseline with a 5.26% evasion rate.

Dependencies

There is an environment.yml included. Please note that it includes the core dependencies only, so it can be used on any platform. It also includes a dependency on scikit-learn and tensorflow because the models used in our research utilized these libraries. If your models do not use that, you can safely remove the dependencies from environment.yml.

The code as of now uses MongoDB to retrieve some pre-processed features. This is yet another dependency that can be removed if you want to handle this differently.

Installing

To install all the dependancies:

conda env create -f environment.yml

Usage

main.py is the entry point to the software. It will require adjustments for your use case as it is not a standalone library right now. The code is documented (see documentation here) to help you figure out what's what since you are not in our heads!

How to Cite?

If you use our software, please consider citing the original paper:

@article{Boutsikas2021EvadingMC,
  title={Evading Malware Classifiers via Monte Carlo Mutant Feature Discovery},
  author={John Boutsikas and M. E. Eren and Charles K. Varga and Edward Raff and Cynthia Matuszek and Charles Nicholas},
  journal={ArXiv},
  year={2021},
  volume={abs/2106.07860}
}

Authors