Detect emerging malware on cloud before VirusTotal can see it
AbstractIn this paper, we present a new methodology to discover emerging malware where new malware candidates are continuously discovered by our general anomaly detection, and the graph learning system predicts the behavior and the threat family using fuzzy similarity %via a correlation knowledge graph to support further analysis by the security researchers, or for the automatic enforcement and remediation. This methodology can be applied at large scale to detect and analyze emerging malware while providing rich contextual information.
V. Hugo G Moia and M. A. Amaral Henriques, “Similarity digest search: A survey and comparative analysis of strategies to perform known file filtering using approximate matching,” Security and Communication Networks, vol. 2017, pp. 1–17, 09 2017.
A. P. Namanya, I. Awan, J. P. Disso, and M. Younas, “Similarity hash based scoring of portable executable files for efficient malware detection in iot,” Future Gener. Comput. Syst., vol. 110, pp. 824–832, 2020.
N. Sarantinos, C. Benzaid, O. Arabiat, and A. Al-Nemrat, “Forensic malware analysis: The value of fuzzy hashing algorithms in identifying similarities,” pp. 1782–1787, 08 2016.
B. Rahbarinia, M. Balduzzi, and R. Perdisci, “Exploring the long tail of (malicious) software downloads,” 2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 391–402, 2017.
M. Botacin, V. Hugo G Moia, F. Ceschin, M. Henriques, and A. Grégio, “Understanding uses and misuses of similarity hashing functions for malware detection and family clustering in actual scenarios,” Forensic Science International: Digital Investigation, vol. 38, p. 301220, 09 2021.
L. Liebler and H. Baier, “Towards exact and inexact approximate matching of executable binaries,” Digital Investigation, vol. 28, pp. S12–S21, 2019.
N. Naik, P. Jenkins, N. Savage, L. Yang, K. Naik, J. Song, T. Boongoen, and N. Iam-On, “Fuzzy hashing aided enhanced yara rules for malware triaging,” pp. 1138–1145, 12 2020.
V. Roussev, “An evaluation of forensic similarity hashes,” Digital Investigation, vol. 8, 08 2011.
F. Breitinger, H. Baier, and J. Beckingham, “Security and implementation analysis of the similarity digest sdhash,” 08 2012.
J. Oliver, C. Cheng, and Y. Chen, “Tlsh – a locality sensitive hash,” in 2013 Fourth Cybercrime and Trustworthy ComputingWorkshop, pp. 7–13, 2013.
F. Breitinger, K. P. Astebøl, H. Baier, and C. Busch, “mvhash-b - a new approach for similarity preserving hashing,” in 2013 Seventh International Conference on IT Security Incident Management and IT Forensics, pp. 33–44, 2013.
D. Chang, S. Sanadhya, and M. Singh, “Security analysis of mvhash-b similarity hashing,” Journal of Digital Forensics, Security and Law, 01 2016.
E. Raff and C. Nicholas, “Lempel-ziv jaccard distance, an effective alternative to ssdeep and sdhash,” Digital Investigation, 08 2017.
A. Pfadler, A. Poliakova, G. Feng, T. Nguyen, A. Fakeri-Tabrizi, H. Liu, and Y. Yuzifovich, “Detect emerging malware on cloud before virustotal can see it,” Botconf, 2021.
V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” Soviet Physics Doklady, 02 1966.
N. Naik, P. Jenkins, N. Savage, L. Yang, T. Boongoen, and N. Iam-On, “Fuzzy-import hashing: A malware analysis approach,” in 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1–8, 2020.
L. Page, S. Brin, R. Motwani, and T. Winograd, “The pagerank citation ranking: Bringing order to the web.,” Technical Report 1999-66, Stanford Info-Lab, November 1999. Previous number = SIDLWP-1999-0120.
W. Hamilton, Z. Ying, and J. Leskovec, “Inductive representation learning on large graphs,” Advances in neural information processing systems, vol. 30, 2017.
K. Berahmand, S. Haghani, M. Rostami, and Y. Li, “A new attributed graph clustering by using label propagation in complex networks,” Journal of King Saud University - Computer and Information Sciences, 2020.
A. Grover and J. Leskovec, “node2vec: Scalable feature learning for networks,” CoRR, vol. abs/1607.00653, 2016.
A. Bhattacharyya and D. Chakravarty, “Graph database: A survey,” in 2020 International Conference on Computer, Electrical Communication Engineering (ICCECE), pp. 1–8, 2020.
W. Fan, T. He, L. Lai, X. Li, Y. Li, Z. Li, Z. Qian, C. Tian, L. Wang, J. Xu, Y. Yao, Q. Yin, W. Yu, K. Zeng, K. Zhao, J. Zhou, D. Zhu, and R. Zhu, “Graphscope: A unified engine for big graph processing,” Proc. VLDB Endow., vol. 14, pp. 2879–2892, 2021.
J. Wing, “Scenario graphs applied to security,” 01 2005.
C. Phillips, “A graph-based system for network-vulnerability analysis,” in Proceedings of the 1998 workshop on New security paradigms, pp. 71–79, ACM Press, 1998.
X. Tao, Y. Liu, F. Zhao, C. Yang, and Y. Wang, “Graph database-based network security situation awareness data storage method,” EURASIP Journal on Wireless Communications and Networking, 2018.
B. Abu Jamous, R. Fa, and A. Nandi, Graph Clustering, pp. 227–246. 04 2015.
J. Creusefond, “A comparison of graph clustering algorithms,” 06 2015.
Y. Peng, X. Zhu, F. Nie, W. Kong, and Y. Ge, “Fuzzy graph clustering,” Information Sciences, vol. 571, 04 2021.
B. Auffarth, “Spectral graph clustering,” 01 2007.
B. Wallace, “Optimizing ssdeep for use at scale.,” technical report, Cylance, USA, November 2015.
L. Allison and T. I. Dix, “A bit-string longestcommon-subsequence algorithm,” Information Processing Letters, vol. 23, no. 5, pp. 305–310, 1986.
“Cryptocurrency miners using hacked cloud accounts, google warns,” The Guardian, 2021.
A. Fakeri-Tabrizi, H. Liu, A. Polyakova, and Y. Einav, “Honeypot + graph learning + reasoning = scale up your emerging threat analysis,” Botconf, 2020.
Copyright (c) 2022 Thanh Nguyen, Gan Feng, Andreas Pfadler, Anastasia Poliakova, Ali Fakeri-Tabrizi, Hongliang Liu, Yuriy Yuzifovich
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.