• DocumentCode
    3108340
  • Title

    Polygraph: automatically generating signatures for polymorphic worms

  • Author

    Newsome, James ; Karp, Brad ; Song, Dawn

  • Author_Institution
    Carnegie Mellon Univ., Pittsburgh, PA, USA
  • fYear
    2005
  • fDate
    8-11 May 2005
  • Firstpage
    226
  • Lastpage
    241
  • Abstract
    It is widely believed that content-signature-based intrusion detection systems (IDS) are easily evaded by polymorphic worms, which vary their payload on every infection attempt. In this paper, we present Polygraph, a signature generation system that successfully produces signatures that match polymorphic worms. Polygraph generates signatures that consist of multiple disjoint content substrings. In doing so, Polygraph leverages our insight that for a real-world exploit to function properly, multiple invariant substrings must often be present in all variants of a payload; these substrings typically correspond to protocol framing, return addresses, and in some cases, poorly obfuscated code. We contribute a definition of the polymorphic signature generation problem; propose classes of signature suited for matching polymorphic worm payloads; and present algorithms for automatic generation of signatures in these classes. Our evaluation of these algorithms on a range of polymorphic worms demonstrates that Polygraph produces signatures for polymorphic worms that exhibit low false negatives and false positives.
  • Keywords
    digital signatures; invasive software; protocols; string matching; Polygraph; automatic generation; intrusion detection systems; multiple disjoint content substrings; multiple invariant substrings; obfuscated code; payload; polymorphic worms; protocol framing; return addresses; signature generation system; Availability; Data security; Databases; IP networks; Intrusion detection; Monitoring; Payloads; Protocols; Telecommunication traffic; Web and internet services;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Security and Privacy, 2005 IEEE Symposium on
  • ISSN
    1081-6011
  • Print_ISBN
    0-7695-2339-0
  • Type

    conf

  • DOI
    10.1109/SP.2005.15
  • Filename
    1425070