Learning DFA representations of HTTP for protecting web applications

  • Authors:
  • Kenneth L. Ingham;Anil Somayaji;John Burge;Stephanie Forrest

  • Affiliations:
  • Department of Computer Science, University of New Mexico, Mail stop: MSC01 1130, Albuquerque, NM 87131-0001, United States;School of Computer Science, Carleton University, 5302 Herzberg Building, 1125 Colonel By Drive, Ottawa, Ont., Canada K1S 5B6;Department of Computer Science, University of New Mexico, Mail stop: MSC01 1130, Albuquerque, NM 87131-0001, United States;Department of Computer Science, University of New Mexico, Mail stop: MSC01 1130, Albuquerque, NM 87131-0001, United States and Santa Fe Institute, 1399 Hyde Park Road, Santa Fe, NM 87501, United S ...

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Intrusion detection is a key technology for self-healing systems designed to prevent or manage damage caused by security threats. Protecting web server-based applications using intrusion detection is challenging, especially when autonomy is required (i.e., without signature updates or extensive administrative overhead). Web applications are difficult to protect because they are large, complex, highly customized, and often created by programmers with little security background. Anomaly-based intrusion detection has been proposed as a strategy to meet these requirements. This paper describes how DFA (Deterministic Finite Automata) induction can be used to detect malicious web requests. The method is used in combination with rules for reducing variability among requests and heuristics for filtering and grouping anomalies. With this setup a wide variety of attacks is detectable with few false-positives, even when the system is trained on data containing benign attacks (e.g., attacks that fail against properly patched servers).