Accurate Malware Detection by Extreme Abstraction

被引:13
作者
Copty, Fady [1 ]
Danos, Matan [1 ]
Edelstein, Orit [1 ]
Eisner, Cindy [1 ]
Murik, Dov [1 ]
Zeltser, Benjamin [1 ]
机构
[1] IBM Res Haifa, Haifa, Israel
来源
34TH ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE (ACSAC 2018) | 2018年
关键词
Malware; Analysis; Detection; Classification; EXECUTION;
D O I
10.1145/3274694.3274700
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Modern malware applies a rich arsenal of evasion techniques to render dynamic analysis ineffective. In turn, dynamic analysis tools take great pains to hide themselves from malware; typically this entails trying to be as faithful as possible to the behavior of a real run. We present a novel approach to malware analysis that turns this idea on its head, using an extreme abstraction of the operating system that intentionally strays from real behavior. The key insight is that the presence of malicious behavior is sufficient evidence of malicious intent, even if the path taken is not one that could occur during a real run of the sample. By exploring multiple paths in a system that only approximates the behavior of a real system, we can discover behavior that would often be hard to elicit otherwise. We aggregate features from multiple paths and use a funnel-like configuration of machine learning classifiers to achieve high accuracy without incurring too much of a performance penalty. We describe our system, TAMALES (The Abstract Malware Analysis LEarning System), in detail and present machine learning results using a 330K sample set showing an FPR (False Positive Rate) of 0.10% with a TPR (True Positive Rate) of 99.11%, demonstrating that extreme abstraction can be extraordinarily effective in providing data that allows a classifier to accurately detect malware.
引用
收藏
页码:101 / 111
页数:11
相关论文
共 33 条
[1]  
[Anonymous], THESIS
[2]  
[Anonymous], 2012, Practical malware analysis: the hands-on guide to dissecting malicious software
[3]   Code Obfuscation Against Symbolic Execution Attacks [J].
Banescu, Sebastian ;
Collberg, Christian ;
Ganesh, Vijay ;
Newsham, Zack ;
Pretschner, Alexander .
32ND ANNUAL COMPUTER SECURITY APPLICATIONS CONFERENCE (ACSAC 2016), 2016, :189-200
[4]   Satisfiability modulo theories [J].
Barrett, Clark ;
Sebastiani, Roberto ;
Seshia, Sanjit A. ;
Tinelli, Cesare .
Frontiers in Artificial Intelligence and Applications, 2009, 185 (01) :825-885
[5]  
Beaucamps P, 2010, LECT NOTES COMPUT SC, V6418, P168, DOI 10.1007/978-3-642-16612-9_14
[6]   SmcHD1, containing a structural-maintenance-of-chromosomes hinge domain, has a critical role in X inactivation [J].
Blewitt, Marnie E. ;
Gendrel, Anne-Valerie ;
Pang, Zhenyi ;
Sparrow, Duncan B. ;
Whitelaw, Nadia ;
Craig, Jeffrey M. ;
Apedaile, Anwyn ;
Hilton, Douglas J. ;
Dunwoodie, Sally L. ;
Brockdorff, Neil ;
Kay, Graham F. ;
Whitelaw, Emma .
NATURE GENETICS, 2008, 40 (05) :663-669
[7]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[8]  
Dahl GE, 2013, INT CONF ACOUST SPEE, P3422, DOI 10.1109/ICASSP.2013.6638293
[9]  
David O.E., 2015, 2015 INT JOINT C NEU, P1, DOI DOI 10.1109/IJCNN.2015.7280815
[10]   A COMPUTING PROCEDURE FOR QUANTIFICATION THEORY [J].
DAVIS, M ;
PUTNAM, H .
JOURNAL OF THE ACM, 1960, 7 (03) :201-215