{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T21:13:25Z","timestamp":1774127605195,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2927075","type":"journal-article","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:03:23Z","timestamp":1562526203000},"page":"91759-91771","source":"Crossref","is-referenced-by-count":53,"title":["CharBot: A Simple and Effective Method for Evading DGA Classifiers"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2929-4164","authenticated-orcid":false,"given":"Jonathan","family":"Peck","sequence":"first","affiliation":[]},{"given":"Claire","family":"Nie","sequence":"additional","affiliation":[]},{"given":"Raaghavi","family":"Sivaguru","sequence":"additional","affiliation":[]},{"given":"Charles","family":"Grumer","sequence":"additional","affiliation":[]},{"given":"Femi","family":"Olumofin","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Anderson","family":"Nascimento","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7917-0771","authenticated-orcid":false,"given":"Martine","family":"De Cock","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/362686.362692"},{"key":"ref38","article-title":"Quantifying maliciousness in alexa top-ranked domains","author":"royal","year":"2012","journal-title":"Proceedings of BlackHat"},{"key":"ref33","article-title":"Using generative adversarial networks to harden phishing classifiers","author":"burns","year":"0","journal-title":"Proc FloCon"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622547"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ECRIME.2017.7945048"},{"key":"ref30","first-page":"15","article-title":"DeepPhish: Simulating malicious AI","author":"bahnsen","year":"2018","journal-title":"Proc IEEE APWG Symp Electron Crime Res"},{"key":"ref37","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Sov Phys -Dokl"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.282"},{"key":"ref35","article-title":"MaskDGA: A black-box evasion technique against DGA classifiers and adversarial defenses","author":"sidi","year":"2019","journal-title":"arXiv 1902 08909"},{"key":"ref34","first-page":"191","article-title":"The long ‘taile’ of typosquatting domain names","author":"szurdi","year":"2014","journal-title":"Proc 23rd USENIX Secur Symp (USENIX Secur )"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00470-5_14"},{"key":"ref40","article-title":"Adversarial texts with gradient methods","author":"gong","year":"2018","journal-title":"arXiv 1801 07175"},{"key":"ref11","first-page":"1165","article-title":"FANCI: Feature-based automated nxdomain classification and intelligence","author":"sch\u00fcppen","year":"2018","journal-title":"Proc Usenix Secur Symp"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8621875"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2018.8489147"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2996758.2996767"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3297280.3297467"},{"key":"ref16","first-page":"192","article-title":"Phoenix: DGA-based botnet tracking and intelligence","author":"schiavoni","year":"2014","journal-title":"Detection of Intrusions and Malware and Vulnerability Assessment"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2015.12.008"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2017.8258361"},{"key":"ref19","article-title":"eXpose: A character-level convolutional neural network with embeddings for detecting malicious URLs, file paths and registry keys","author":"saxe","year":"2017","journal-title":"arXiv 1702 08568"},{"key":"ref28","article-title":"PassGAN: A deep learning approach for password guessing","author":"hitaj","year":"2017","journal-title":"arXiv 1709 00440"},{"key":"ref4","article-title":"Predicting domain generation algorithms with long short-term memory networks","author":"woodbridge","year":"2016","journal-title":"arXiv 1611 00791"},{"key":"ref27","first-page":"2672","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2184552"},{"key":"ref6","article-title":"Automatic detection of malware-generated domains with recurrent neural models","author":"lison","year":"2017","journal-title":"arXiv 1709 07102"},{"key":"ref29","article-title":"Generating adversarial malware examples for black-box attacks based on GAN","author":"hu","year":"2017","journal-title":"arXiv 1702 05983"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.11.018"},{"key":"ref8","first-page":"640","article-title":"Algorithmically generated domain detection and malware family classification","author":"choudhary","year":"2018","journal-title":"Proc 6th Int Symp Secur Comput Commun (SSCC)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2017.96"},{"key":"ref2","first-page":"491","article-title":"From throw-away traffic to bots: Detecting the rise of DGA-based malware","volume":"12","author":"antonakakis","year":"2012","journal-title":"Proc Usenix Security Symp"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622066"},{"key":"ref1","first-page":"263","article-title":"A comprehensive measurement study of domain generating malware","author":"plohmann","year":"2016","journal-title":"Proc Usenix Security Symp"},{"key":"ref20","first-page":"1","volume":"12","author":"vorobeychik","year":"2018","journal-title":"Adversarial machine learning"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081950"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014066"},{"key":"ref24","article-title":"Explaining and harnessing adversarial examples","author":"goodfellow","year":"2014","journal-title":"arXiv 1412 6572"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P18-2006"},{"key":"ref23","article-title":"Good word attacks on statistical spam filters","author":"lowd","year":"2005","journal-title":"Proc CEAS"},{"key":"ref26","first-page":"10877","article-title":"Semidefinite relaxations for certifying robustness to adversarial examples","author":"raghunathan","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref25","article-title":"Towards deep learning models resistant to adversarial attacks","author":"madry","year":"2017","journal-title":"arXiv 1706 06083"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08756038.pdf?arnumber=8756038","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T19:40:00Z","timestamp":1628624400000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8756038\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2927075","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}