Explaining Black-box Android Malware Detection
Marco Melis, Davide Maiorca, Battista Biggio, Giorgio Giacinto and, Fabio Roli

TL;DR
This paper introduces a gradient-based method to interpret black-box Android malware detection models, enhancing understanding of their decisions and vulnerabilities, and addressing the fragility of traditional benchmark evaluations.
Contribution
It generalizes explainability techniques to any black-box model, allowing for improved interpretability and vulnerability analysis in Android malware detection.
Findings
Effective identification of influential features for any model
Reveals global model characteristics for malware detection
Highlights potential adversarial vulnerabilities
Abstract
Machine-learning models have been recently used for detecting malicious Android applications, reporting impressive performances on benchmark datasets, even when trained only on features statically extracted from the application, such as system calls and permissions. However, recent findings have highlighted the fragility of such in-vitro evaluations with benchmark datasets, showing that very few changes to the content of Android malware may suffice to evade detection. How can we thus trust that a malware detector performing well on benchmark data will continue to do so when deployed in an operating environment? To mitigate this issue, the most popular Android malware detectors use linear, explainable machine-learning models to easily identify the most influential features contributing to each decision. In this work, we generalize this approach to any black-box machine- learning model,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsInterpretability
