P2P hierarchical botnet traffic detection using hidden Markov models

  • Authors:
  • Chen Lu;Richard R. Brooks

  • Affiliations:
  • Clemson University;Clemson University

  • Venue:
  • Proceedings of the 2012 Workshop on Learning from Authoritative Security Experiment Results
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Botnets are a major source of spam, distributed denial-of-service attacks (DDoS) and other cybercrime [21]. Compromised computers are usually controlled by a centralized Command and Control (C&C) server. Hidden Markov models (HMMs) have been used successfully to detect centralized botnet traffic, such as the Zeus botnet [9], which is one of the largest botnet in the wild. To avoid the disadvantages of centralized structures, hierarchical botnets now use P2P techniques. In this work, we applied our HMM approach for centralized botnet detection to hierarchical botnet traffic detection based on traffic timing data. We attempted to infer hidden Markov models from botnet traffic timings. However the inferred model is not statistically significant. Usually this can be solved by using larger data sets. Oddly, when we infer models with additional data, the required amount of data for model confidence keeps increasing. While using the approximate HMM for detection, we can not accurately detect botnet traffic like we can for centralized botnet traffic. Reasons for this and possible solutions are discussed.