Towards Automatic Generation of Vulnerability-Based Signatures

  • Authors:
  • David Brumley;James Newsome;Dawn Song;Hao Wang;Somesh Jha

  • Affiliations:
  • Carnegie Mellon University;Carnegie Mellon University;Carnegie Mellon University;University of Wisconsin-Madison;University of Wisconsin-Madison

  • Venue:
  • SP '06 Proceedings of the 2006 IEEE Symposium on Security and Privacy
  • Year:
  • 2006

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper we explore the problem of creating vulnerability signatures. A vulnerability signature matches all exploits of a given vulnerability, even polymorphic or metamorphic variants. Our work departs from previous approaches by focusing on the semantics of the program and vulnerability exercised by a sample exploit instead of the semantics or syntax of the exploit itself. We show the semantics of a vulnerability define a language which contains all and only those inputs that exploit the vulnerability. A vulnerability signature is a representation (e.g., a regular expression) of the vulnerability language. Unlike exploitbased signatures whose error rate can only be empirically measured for known test cases, the quality of a vulnerability signature can be formally quantified for all possible inputs.