Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Christopher Tate Beasley

dblp:196/5967 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2017
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
1 paper
Network security · 67% Malware analysis · 33%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network security › intrusion detection and prevention › intrusion detection › malicious traffic detection
botnet detection
0.312017
Stealthy Domain Generation Algorithms · IEEE Trans. Inf. Forensics Secur. 2017
Malware analysis › botnet
domain generation algorithm
0.312017
Stealthy Domain Generation Algorithms · IEEE Trans. Inf. Forensics Secur. 2017
Network security › intrusion detection and prevention
intrusion detection
0.312017
Stealthy Domain Generation Algorithms · IEEE Trans. Inf. Forensics Secur. 2017
Algorithmic game theory and mechanism design
security games
0.112017
Stealthy Domain Generation Algorithms · IEEE Trans. Inf. Forensics Secur. 2017

Methods — techniques the papers use, named apart from their topics

probabilistic context-free grammar · 0.6hidden markov model · 0.6game theory · 0.6
YearPublicationVenuePosition
2017 Stealthy Domain Generation Algorithms
abstract
Botnets are groups of compromised computers that botmasters (botherders) use to launch attacks over the Internet. To avoid detection, botnets use DNS fast flux to change the mapping between IP addresses and domain names periodically. Domain generation algorithms (DGAs) are employed to generate a large number of domain names. Detection techniques have been proposed to identify malicious domain names generated by DGAs. Three metrics, Kullback-Leibler (KL) distance, Edit distance (ED), and Jaccard index (JI), are used to detect botnet domains with up to 100% detection rate and 2.5% false-positive rate. In this paper, we propose two DGAs that use hidden Markov models (HMMs) and probabilistic context-free grammars (PCFGs), respectively. Experiment results show that DGA detection metrics (KL, JI, and ED) and detection systems (BotDigger and Pleiades) have difficulty detecting domain names generated using the proposed approaches. Game theory is used to optimize strategies for both botmasters and security personnel. Results show that, to optimize DGA detection, security personnel should use the ED detection technique with probability 0.78 and JI detection with probability 0.22, and botmasters should choose the HMM-based DGA with probability 0.67 and PCFG-based DGA with probability 0.33.
Yu Fu 0005, Lu Yu 0001, Oluwakemi Hambolu, Ilker Özçelik, Benafsh Husain, Jingxuan Sun, Karan Sapra, Dan Du, Christopher Tate Beasley, Richard R. Brooks
IEEE Trans. Inf. Forensics Secur.9