Fetching the paper…
Reading the bibliography…
Windows malware detectors based on machine learning are vulnerable to adversarial examples, even if the attacker is only given black-box query access to the model.
J. Moody, “Fast learning in multi-resolution hierarchies,” in NeurIPS , 1989, pp. 29–39
1989
Earlier work this paper cites.
L. Huang, A. D. Joseph, B. Nelson, B. I. Rubinstein, and J. D. Tygar, “Adversarial machine learning,” in 4th AISec . ACM, 2011, pp. 43–58
2011
Earlier work this paper cites.
F.-A. Fortin, F.-M. De Rainville, M.-A. Gardner, M. Parizeau, and C. Gagné, “DEAP: Evolutionary algorithms made easy,” JMLR , vol. 13, pp. 2171–2175, jul 2012
2012
Earlier work this paper cites.
C. Smutz and A. Stavrou, “Malicious pdf detection using metadata and structural features,” in 28th Annual Comp. Sec. App. Conf. (CCS) . ACM, 2012, pp. 239–248
2012
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in NeurIPS , 2014, pp. 2672–2680
2014
Earlier work this paper cites.
P. Laskov et al. , “Practical evasion of a learning-based classifier: A case study,” in IEEE Symp. S&P . IEEE, 2014, pp. 197–211
2014
Earlier work this paper cites.
J. Saxe and K. Berlin, “Deep neural network based malware detection using two dimensional binary program features,” in 10th Int’l Conf. Malicious and Unwanted Software . IEEE, 2015, pp. 11–20
2015
Earlier work this paper cites.
O. E. David and N. S. Netanyahu, “Deepsign: Deep learning for automatic malware signature generation and classification,” in Int’l Joint Conf. Neural Networks (IJCNN) . IEEE, 2015, pp. 1–8
2015
Earlier work this paper cites.
B. Kolosnjaji, A. Zarras, G. Webster, and C. Eckert, “Deep learning for classification of malware system call sequences,” in Australasian Joint Conference on Artificial Intelligence . Springer, 2016, pp. 137–149
2016
Earlier work this paper cites.
W. Hardy, L. Chen, S. Hou, Y. Ye, and X. Li, “DL4MD: A deep learning framework for intelligent malware detection,” in Int’l Conf. Data Mining (DMIN) . CSREA Press 2016, pp. 61–67
2016
Earlier work this paper cites.
W. Xu, Y. Qi, and D. Evans, “Automatically evading classifiers,” in NDSS , 2016, pp. 21–24
2016
Earlier work this paper cites.
H. S. Anderson, A. Kharkar, B. Filar, and P. Roth, “Evading machine learning malware detection,” Black Hat , 2017
2017
Cited alongside, same era.
2017
Cited alongside, same era.
G. Ke, Q. Meng, T. Finley, T. Wang, W. Chen, W. Ma, Q. Ye, and T.-Y. Liu, “Lightgbm: A highly efficient gradient boosting decision tree,” in NeurIPS , 2017, pp.3146–3154
2017
Cited alongside, same era.
I. Incer, M. Theodorides, S. Afroz, and D. Wagner, “Adversarially robust malware detection using monotonic classification,” in 4th Int’l Workshop Sec. Privacy Analytics . ACM, 2018, pp. 54–63
2018
Cited alongside, same era.
H. S. Anderson and P. Roth, “EMBER: An Open Dataset for Training Static PE Malware Machine Learning Models,” ArXiv e-prints , 2018
L. Demetrio, B. Biggio, G. Lagorio, F. Roli, and A. Armando, “Explaining vulnerabilities of deep learning to adversarial malware binaries,” in 3rd Italian Conf. Cyber Security (ITASEC) , 2019
2019
Later among the works it cites.
R. L. Castro, C. Schmitt, and G. D. Rodosek, “Armed: How automatic malware modifications can evade static detection?” in 5th Int’l Conference on Information Management (ICIM) . IEEE, 2019, pp. 20–27
2019
Later among the works it cites.
R. Labaca Castro, C. Schmitt, and G. D. Rodosek, “Aimed: Evolving malware with genetic programming to evade detection,” in 18th Int’l Conf. TrustCom . IEEE, 2019
2019
Later among the works it cites.
L. Tong, B. Li, C. Hajaj, C. Xiao, N. Zhang, and Y. Vorobeychik, “Improving robustness of ML classifiers against realizable evasion attacks using conserved features,” in USENIX Sec. , 2019, pp. 285–302
2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
E. Raff, J. Barker, J. Sylvester, R. Brandon, B. Catanzaro, and C. K. Nicholas, “Malware detection by eating a whole EXE,” in Workshops of 32nd AAAI, USA, February , 2018, pp. 268–276
2018
Cited alongside, same era.
B. Biggio and F. Roli, “Wild patterns: Ten years after the rise of adversarial machine learning,” Patt. Rec. , vol. 84, pp. 317–331, 2018
2018
Cited alongside, same era.
B. Kolosnjaji, A. Demontis, B. Biggio, D. Maiorca, G. Giacinto, C. Eckert, and F. Roli, “Adversarial malware binaries: Evading deep learning for malware detection in executables,” in 26th European Signal Proc. Conf. (EUSIPCO) . IEEE, 2018, pp. 533–537
2018
Cited alongside, same era.
F. Kreuk, A. Barak, S. Aviv-Reuven, M. Baruch, B. Pinkas, and J. Keshet, “Adversarial examples on discrete sequences for beating whole-binary malware detection,” arXiv preprint , 2018
2018
Cited alongside, same era.
I. Rosenberg, A. Shabtai, L. Rokach, and Y. Elovici, “Generic black-box end-to-end attack against state of the art API call based malware classifiers,” in RAID . Springer, 2018, pp. 490–510
2018
Cited alongside, same era.
O. Suciu, S. E. Coull, and J. Johns, “Exploring adversarial examples in malware detection,” in IEEE S&P Worksh. IEEE, 2019, pp. 8–14
2019
Later among the works it cites.
M. Wenzl, G. Merzdovnik, J. Ullrich, and E. Weippl, “From hack to elaborate technique—a survey on binary rewriting,” ACM Computing Surveys , vol. 52, no. 3, pp. 1–37, 2019
2019
Later among the works it cites.
A. Paszke, S. Gross, F. Massa, A. Lerer, J. Bradbury, G. Chanan, T. Killeen, Z. Lin, N. Gimelshein, L. Antiga, et al. , “Pytorch: An imperative style, high-performance deep learning library,” in NeurIPS , 2019, pp. 8026–8037
2019
Later among the works it cites.
Ceschin, Fabrício and Botacin, Marcus and Gomes, Heitor Murilo and Oliveira, Luiz S and Grégio, André, “Shallow security: On the creation of adversarial variants to evade machine learning-based malware detectors,” in Proceedings of the 3rd Reversing and Offensive-oriented Trends Symposium . ACM, 2019
2019
Later among the works it cites.
2020
Closest in time.