Formalizing Attack Mutation for NIDS Testing

dc.contributor.authorRubin, Shaien_US
dc.contributor.authorJha, Someshen_US
dc.contributor.authorMiller, Barton P.en_US
dc.date.accessioned2012-03-15T17:18:54Z
dc.date.available2012-03-15T17:18:54Z
dc.date.created2005en_US
dc.date.issued2005en_US
dc.description.abstractAttack mutation is a common way to test a misuse Network Intrusion Detection System (NIDS). In this technique, a known instance of an attack is transformed by repeatedly applying attack transformations into many distinct instances. For example, we cangenerate many instances of an HTTP attack by splitting it into TCP segments in many different ways. The underlying intuition behind attack mutation is that many attack instances are derivable from a few simple exemplary instances. We formally justify the intuition behind attack mutation. We prove that for many transformations, all mutations of an attack are derivable from each other. Furthermore, we show that all mutations can be derived from a few atoms which are the simplest versions of the attack. Based on our findings, we developed two algorithms: testing and forensics. Given a set of transformations, our testing algorithm derives all attack mutations (up to a certain length) from an exemplary attack instance. Our forensics algorithm complements the testing one; it determines whether two mutations are derivable from each other. Our algorithms accommodate most of the known transformations, so the algorithms can be immediately integrated into existing NIDS testing tools.en_US
dc.format.mimetypeapplication/pdfen_US
dc.identifier.citationTR1522en_US
dc.identifier.urihttp://digital.library.wisc.edu/1793/60430
dc.publisherUniversity of Wisconsin-Madison Department of Computer Sciencesen_US
dc.titleFormalizing Attack Mutation for NIDS Testingen_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
TR1522.pdf
Size:
2.49 MB
Format:
Adobe Portable Document Format