Abstract
Machine learning (ML) techniques are increasingly common in security applications, such as malware and intrusion detection. However, ML models are often susceptible to evasion attacks, in which an adversary makes changes to the input (such as malware) in order to avoid being detected. A conventional approach to evaluate ML robustness to such attacks, as well as to design robust ML, is by considering simplified feature-space models of attacks, where the attacker changes ML features directly to effect evasion, while minimizing or constraining the magnitude of this change. We investigate the effectiveness of this approach to designing robust ML in the face of attacks that can be realized in actual malware (realizable attacks). We demonstrate that in the context of structure-based PDF malware detection, such techniques appear to have limited effectiveness, but they are effective with content-based detectors. In either case, we show that augmenting the feature space models with conserved features (those that cannot be unilaterally modified without compromising malicious functionality) significantly improves performance. Finally, we show that feature space models enable generalized robustness when faced with a variety of realizable attacks, as compared to classifiers which are tuned to be robust to a specific realizable attack.
Original language | English |
---|---|
Title of host publication | Proceedings of the 28th USENIX Security Symposium |
Publisher | USENIX Association |
Pages | 285-302 |
Number of pages | 18 |
ISBN (Electronic) | 9781939133069 |
State | Published - 2019 |
Externally published | Yes |
Event | 28th USENIX Security Symposium - Santa Clara, United States Duration: 14 Aug 2019 → 16 Aug 2019 |
Publication series
Name | Proceedings of the 28th USENIX Security Symposium |
---|
Conference
Conference | 28th USENIX Security Symposium |
---|---|
Country/Territory | United States |
City | Santa Clara |
Period | 14/08/19 → 16/08/19 |
Bibliographical note
Publisher Copyright:© 2019 by The USENIX Association. All rights reserved.
Funding
This work was partially supported by the Army Research Office (W911NF1610069) and NSF CAREER award (IIS-1649972).
Funders | Funder number |
---|---|
National Science Foundation | IIS-1649972 |
Army Research Office | W911NF1610069 |
National Sleep Foundation |