You are here

Finite Automata Models for Anomaly Detection

Type: 
Conference PaperInvited and refereed articles in conference proceedings
Authored by:
V. R. Ramezani, Yang, Shahan., Baras, John S.
Conference date:
March 12-14, 2003
Conference:
37th Conference on Information Sciences and Systems (CISS)
Full Text Paper: 
Abstract: 

A fundamental problem in Intrusion detection is the fusion of dependent information sequences.In this paper ,we consider the fusion of two such sequences ,namely the sequence of system calls and the value of the instruction pointer.We introduce FAAD, a finite automation representation defined for the product alphabet of the two sequences where dependencies are implicitly taken into account by a matching procedure.