skip to main content
10.1145/2459976.2459992acmotherconferencesArticle/Chapter ViewAbstractPublication PagescsiirwConference Proceedingsconference-collections
research-article

Timing analysis in P2P botnet traffic using probabilistic context-free grammars

Published:08 January 2013Publication History

ABSTRACT

Botnets are becoming a major source of spam, private data and money steal and other cybercrime. During the battle with security communities, botnets became Tailored Trustworthy Spaces (TTS). Bot herders first used encryption and access control of the botnet command and control channel to secure botnet communications. The use of fastflux and P2P technologies help botnets become more resilient to detection and takendown. Their fast evolving propagation, command and control, and attacks make botnets good examples of moving targets. Detecting and removing botnets has become a difficult and important task for security community. In this paper, we apply timing analysis on P2P hierarchical botnet traffic, since timing signatures commonly exist in automated network processes. We extend previous work to use probabilistic context-free grammars (PCFGs), a more expressive grammar in the Chomsky hierarchy. Experiment results of simulated P2P botnet show that PCFGs have accurate detection rates. Our approach provides possible "exploits" to compromise TTS and moving target systems. Therefore timing signatures should be considered in design to make the system more secure and resilient.

References

  1. Citadel - An Open-Source Malware Project. http://blog.seculert.com/2012/02/citadel-open-source-malware-project.html.Google ScholarGoogle Scholar
  2. Robot Wars - How Botnets Work. http://www.windowsecurity.com/articles/robot-wars-how-botnets-work.html.Google ScholarGoogle Scholar
  3. The threat from P2P botnets. http://www.securelist.com/en/blog/654/Lab_Matters_The_threat_from_P2P_botnets.Google ScholarGoogle Scholar
  4. ZeuS Gets More Sophisticated Using P2P Techniques. http://www.abuse.ch/?p=3499.Google ScholarGoogle Scholar
  5. Zeus: God of DIY Botnets. http://www.fortiguard.com/analysis/zeusanalysis.html.Google ScholarGoogle Scholar
  6. A. V. Aho, M. S. Lam, R. Sethi, and J. D. Ullman. Compilers: Principles, techniques, and tools, 2nd edition. Pearson Education Inc., 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. M. Bailey, E. Cooke, F. Jahanian, Y. Xu, and M. Karir. A survey of botnet technology and defenses. Conference For Homeland Security, Cybersecurity Applications and Technology, 0:299--304, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Geman and M. Johnson. Probabilistic grammars and their applications. In International Encyclopedia of the Social & Behavioral Sciences, pages 12075--12082, 2002.Google ScholarGoogle Scholar
  9. C. Lu and R. Brooks. Botnet traffic detection using hidden markov models. In Proceedings of the Seventh Annual Workshop on Cyber Security and Information Intelligence Research, CSIIRW '11, pages 31:1--31:1, New York, NY, USA, 2011. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Lu and R. Brooks. P2p hierarchical botnet traffic detection using hidden markov models. Learning from Authoritative Security Experiment Results Workshop Proceedings, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. C. D. Manning and H. Schutze. Foundations of statistical natural language processing. The MIT Press, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. J. Neter, W. Wasserman, and M. H. Kutner. Applied linear regression models. Irwin Press, 1989.Google ScholarGoogle Scholar
  13. C. Noam. Three models for the description of language. Information Theory, IRE Transactions, 2(3):113--124, 1956.Google ScholarGoogle Scholar
  14. G. Ollmann. Botnet communication topologies. White Paper of Damballa, 2009.Google ScholarGoogle Scholar
  15. L. Wei, T. Mahbod, and A. A. Ghorbani. Automatic discovery of botnet communities on large-scale communication networks. In Proceedings of the 4th International Symposium on Information, Computer, and Communications Security, ASIACCS '09, pages 1--10, New York, NY, USA, 2009. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. Wilson. Botnets, cybercrime, and cyberterrorism: Vulnerabilities and policy issues for congress. CRS Report for Congress, 2009.Google ScholarGoogle Scholar
  17. D. Zwillinger. Standard mathematical tables and formulae. Chapman & Hall/CRC, 2003.Google ScholarGoogle Scholar

Index Terms

  1. Timing analysis in P2P botnet traffic using probabilistic context-free grammars

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      CSIIRW '13: Proceedings of the Eighth Annual Cyber Security and Information Intelligence Research Workshop
      January 2013
      282 pages
      ISBN:9781450316873
      DOI:10.1145/2459976

      Copyright © 2013 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 8 January 2013

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader