Exploiting Statistical and Structural Features for the Detection of Domain Generation Algorithms
Constantinos Patsakis, Fran Casino

TL;DR
This paper presents a probabilistic method to detect dictionary-based DGAs that mimic legitimate domains, addressing evasion tactics used by sophisticated malware campaigns.
Contribution
It introduces an accurate, efficient probabilistic approach specifically targeting dictionary-based DGAs that evade entropy-based detection methods.
Findings
Effective detection of dictionary-based DGAs demonstrated
Outperforms existing state-of-the-art methods
Validated on comprehensive dataset
Abstract
Nowadays, malware campaigns have reached a high level of sophistication, thanks to the use of cryptography and covert communication channels over traditional protocols and services. In this regard, a typical approach to evade botnet identification and takedown mechanisms is the use of domain fluxing through the use of Domain Generation Algorithms (DGAs). These algorithms produce an overwhelming amount of domain names that the infected device tries to communicate with to find the Command and Control server, yet only a small fragment of them is actually registered. Due to the high number of domain names, the blacklisting approach is rendered useless. Therefore, the botmaster may pivot the control dynamically and hinder botnet detection mechanisms. To counter this problem, many security mechanisms result in solutions that try to identify domains from a DGA based on the randomness of their…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
