2017 25th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP) 2017
DOI: 10.1109/pdp.2017.41
|View full text |Cite
|
Sign up to set email alerts
|

Parallelization of Machine Learning Applied to Call Graphs of Binaries for Malware Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
3
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(5 citation statements)
references
References 10 publications
0
3
0
Order By: Relevance
“…The scale of malware detection problem is such that we have millions of samples already and thousands streaming in every day. Many classic graph mining based approaches (e.g., [48]) are NP hard and have severe scalability issues, making them impractical for malware detection in the wild [30,75].…”
Section: Challenges In ML Based Malware Detectionmentioning
confidence: 99%
“…The scale of malware detection problem is such that we have millions of samples already and thousands streaming in every day. Many classic graph mining based approaches (e.g., [48]) are NP hard and have severe scalability issues, making them impractical for malware detection in the wild [30,75].…”
Section: Challenges In ML Based Malware Detectionmentioning
confidence: 99%
“…We achieved a prediction accuracy of 99.41% in the malware family classification task. Our approach outperforms other malware classifiers that involve extensive feature engineering or extract significantly more data from the executable such as non-code data [8,9,20]. Since we only use the code sections of the executable, we expect that incorporating additional data such as the .rsrc and .idata sections would help to further improve classification results.…”
Section: Resultsmentioning
confidence: 98%
“…In prior works, call graphs have been used to automatically classify malware but typically these works employ relatively simple graph similarity measures such as graph edit distance or rely on heavy feature engineering involving summary statistics to describe functions in the graph [9,20,6,5]. We build on this call graph approach by incorporating certain representation learning techniques such as autoencoding and clustering [7] to obtain an improved function representation.…”
Section: Related Workmentioning
confidence: 99%
“…Elect.Crime Investigation 8(1):IJECI MS.ID-02 (2024) Ali [67] Gavrilut [69] Ghafir [100] Ghiasi [87] Huda [89] Huda [116] Huda [78] Ki [118] Kim [77] Kolosnjaji [41] Le [97] Liu [19] Mangialardo [109] The statistical examination of ML revealing techniques is covered in this part of the paper. Raff [42] Searles [117] Shabtai [72] Shijo [110] Srndic [76] Stiborek [99] Veeramani [26] Wagner [95] Wang [80] Mao [119] Markel [43] Mohaisen [81] Nagano and Uda [79] Narra [3] Nauman [113] Nayaranan [92] Okane [120] Pan [88] Pfeffer [115] Pirscoveanu [65] revealing techniques. The greatest accuracy of 99 % was obtained by [117] the authors in [77], and [27] using the SVM classification methods.…”
Section: Hybrid Malware Detectionmentioning
confidence: 99%
“…Raff [42] Searles [117] Shabtai [72] Shijo [110] Srndic [76] Stiborek [99] Veeramani [26] Wagner [95] Wang [80] Mao [119] Markel [43] Mohaisen [81] Nagano and Uda [79] Narra [3] Nauman [113] Nayaranan [92] Okane [120] Pan [88] Pfeffer [115] Pirscoveanu [65] revealing techniques. The greatest accuracy of 99 % was obtained by [117] the authors in [77], and [27] using the SVM classification methods. Fig.…”
Section: Hybrid Malware Detectionmentioning
confidence: 99%