skip to main content
10.1145/1159913.1159951acmconferencesArticle/Chapter ViewAbstractPublication PagescommConference Proceedingsconference-collections
Article
Free Access

Detecting evasion attacks at high speeds without reassembly

Published:11 August 2006Publication History

ABSTRACT

Ptacek and Newsham [14] showed how to evade signature detection at Intrusion Prevention Systems (IPS) using TCP and IP Fragmentation. These attacks are implemented in tools like FragRoute, and are institutionalized in IPS product tests. The classic defense is for the IPS to reassemble TCP and IP packets,and to consistently normalize the output stream. Current IPS standards require keeping state for 1 million connections. Both the state and processing requirements of reassembly and normalization are barriers to scalability for an IPS at speeds higher than 10 Gbps.In this paper, we suggest breaking with this paradigm using an approach we call Split-Detect. We focus on the simplest form of signature, an exact string match, and start by splitting the signature into pieces. By doing so the attacker is either forced to include at least one piece completely in a packet, or to display potentially abnormal behavior (e.g., several small TCP fragments or out-of-order packets) that cause the attacker's flow to be diverted to a slow path. We prove that under certain assumptions this scheme can detect all byte-string evasions. We also show using real traces that the processing and storage requirements of this scheme can be 10% of that required by a conventional IPS, allowing reasonable cost implementations at 20 Gbps. While the changes required by Split-Detect may be a barrier to adoption, this paper exposes the assumptions that must be changed to avoid normalization and reassembly in the fast path.

References

  1. Alfred V. Aho and Margaret J. Corasick. "Efficient string matching: An aid to bibliographic search." Communications of the ACM 18(6):333--340, June 1975. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. N. Alon, Y. Matias, and M. Szegedy. "The space complexity of approximating the frequency moments". Proceedings 28th ACM Symp. on Theory of Computing pages 20--29, May 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. G. Appenzeller, I. Keslassy, and N. McKeown "Sizing Router Buffers". Proceedings of ACM SIGCOMM 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. D. Clark, "The Structuring of Systems Using Upcalls". Proceedings of the 10th ACM Symposium on Operating Systems Principles pp. 171--180, December 1-4 1985. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. S. Dharmapurikar, P. Krishnamurthy, T. Sproull, and J. W. Lockwood, "Deep packet inspection using parallel Bloom filters. Hot Interconnects Aug. 2003.Google ScholarGoogle Scholar
  6. S. Dharmapurikar, V. Paxson, "Robust TCP stream reassembly in the presence of adversaries". Proceedings of the 14th USENIXSecurity Symposium Baltimore, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. "The Future of the Internet". Red Herring April 10th, 2006.Google ScholarGoogle Scholar
  8. M. Handley, C. Kreibich, and V. Paxson. "Network Intrusion Detection: Evasion, Traffic Normalization, and End-to-End Protocol Semantics". Proc. USENIX Security Symposium May 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. K. Levchenko, R. Paturi, and G. Varghese. "On the Difficulty of Scalably Detecting Network Attacks". Proc. of the Eleventh ACM Conference on Computer and Communication Security October 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Nikto, http://www.cirt.net/code/nikto.shtmlGoogle ScholarGoogle Scholar
  11. NSS Group.Intrusion Prevention Systems (IPS)Group Test (Edition 3), NSS Group, August 2005, http://www.nss.co.ukGoogle ScholarGoogle Scholar
  12. V. Paxson, "Bro: A System for Detecting Network Intruders in Real-Time". Computer Networks 31(23-24), pp. 2435--2463, 14 Dec 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. V. Paxson and M. Handley, "Defending Against NIDS Evasion using Traffic Normalizers". Second International Workshop on the Recent Advances in Intrusion Detection September 1999.Google ScholarGoogle Scholar
  14. T. Ptacek and T. Newsham. "Insertion, Evasion and Denial of Service: Eluding Network Intrusion Detection", Secure Networks, Inc., Jan. 1998.Google ScholarGoogle Scholar
  15. M. Roesch, "Snort-Lightweight Intrusion Detection for Networks", LISA 99 Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. C. Shannon, D. Moore, k. claffy, "Characteristics of Fragmented IP Traffic on Internet Links", Workshop on Passive and Active Measurement 2001.Google ScholarGoogle Scholar
  17. Dug Song, 2002, Fragroute, http://www.monkey.org/dugsong/fragroute/Google ScholarGoogle Scholar

Index Terms

  1. Detecting evasion attacks at high speeds without reassembly

    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 Conferences
      SIGCOMM '06: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
      September 2006
      458 pages
      ISBN:1595933085
      DOI:10.1145/1159913
      • cover image ACM SIGCOMM Computer Communication Review
        ACM SIGCOMM Computer Communication Review  Volume 36, Issue 4
        Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
        October 2006
        445 pages
        ISSN:0146-4833
        DOI:10.1145/1151659
        Issue’s Table of Contents

      Copyright © 2006 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 11 August 2006

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      Overall Acceptance Rate554of3,547submissions,16%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader