skip to main content
article

Honeycomb: creating intrusion detection signatures using honeypots

Authors Info & Claims
Published:01 January 2004Publication History
Skip Abstract Section

Abstract

This paper describes a system for automated generation of attack signatures for network intrusion detection systems. Our system applies pattern-matching techniques and protocol conformance checks on multiple levels in the protocol hierarchy to network traffic captured a honeypot system. We present results of running the system on an unprotected cable modem connection for 24 hours. The system successfully created precise traffic signatures that otherwise would have required the skills and time of a security officer to inspect the traffic manually.

References

  1. V. Paxson, "Bro: A System for Detecting Network Intruders in Real-Time," Computer Networks (Amsterdam, Netherlands: 1999), vol. 31, no. 23--24, pp. 2435--2463, 1998. {Online}. Available: http://citeseer.nj.nec.com/article/paxson98bro.html.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Roesch, "Snort: Lightweight Intrusion Detection for Networks," in Proceedings of the 13th Conference on Systems Administration, 1999, pp. 229--238.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. C. Stoll, The Cuckoo's Egg. Addison-Wesley, 1986.]]Google ScholarGoogle Scholar
  4. W. R. Cheswick, "An Evening with Berferd, in which a Cracker is lured, endured, and studied," in Proceedings of the 1992 Winter USENIX Conference, 1992.]]Google ScholarGoogle Scholar
  5. L. Spitzner, Honeypots: Tracking HacKers. Addison-Wesley, 2003. {Online}. Available: http://www.tracking-hackers.com/book/]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. Provos, "Honeyd - A Virtual Honeypot Daemon," in 10th DFN-CERT Workshop, Hamburg, Germany, February 2003.]]Google ScholarGoogle Scholar
  7. D. Gusfield, Algorithms on Strings, Trees and Sequences. Cambridge University Press, 1997.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Weiner, "Linear pattern matching algorithms," in Proceedings of the 14th IEEE Symposium on Switching and Automata Theory, 1973, pp. 1--11.]]Google ScholarGoogle Scholar
  9. E. M. McCreight, "A space-economical suffix-tree construction algorithm," Journal of the ACM, vol. 23, pp. 262--272, 1976.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. E. Ukkonen, "On-line construction of suffix trees," Algorithmica, no. 14, pp. 249--260, 1995.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. S. McCanne, C. Leres, and V. Jacobson, "tcpdump/libpcap," http://www.tcpdump.org/, 1994.]]Google ScholarGoogle Scholar
  12. M. Handley, C. Kreibich, and V. Paxson, "Network Intrusion Detection: Evasion, Traffic Normalization, end End-to-End Protocol Semantics," in Proceedings of the 9th USENIX Security Symposium, 2000.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. H. Ptacek and T. N. Newsham, "Insertion, Evasion and Denial of Service: Eluding Network Intrusion Detection," Secure Networks, Inc., Tech. Rep., 1998.]]Google ScholarGoogle Scholar

Index Terms

  1. Honeycomb: creating intrusion detection signatures using honeypots
    Index terms have been assigned to the content through auto-classification.

    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

    Full Access

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader