You are here

Graph Matching Intrusion Detection for the Insider Threat

Award Information
Agency: Department of Defense
Branch: Army
Contract: DAAD17-03-C-006
Agency Tracking Number: A022-2379
Amount: $119,805.00
Phase: Phase I
Program: SBIR
Solicitation Topic Code: N/A
Solicitation Number: N/A
Solicitation Year: N/A
Award Year: 2003
Award Start Date (Proposal Award Date): N/A
Award End Date (Contract End Date): N/A
Small Business Information
11675 Jollyville Road, Suite 300
Austin, TX 78759
United States
HUBZone Owned: No
Woman Owned: No
Socially and Economically Disadvantaged: No
Principal Investigator
 Sherry Marcus
 (512) 342-0010
Business Contact
 Darrin Taylor
Title: COO
Phone: (512) 342-0010
Research Institution

We propose the Graph Matching Intrusion Detection (GMID) system, a novel approach to detecting insider and coordinated insider-outsider threats based on our algorithms for solving the subgraph isomorphism (graph matching) problem. GMID performs datafusion on information from dense sensor networks inside and outside the secured system to build a graph representation of network topology, user activity, and network state. Threat patterns are represented as graphs, and our graph matching algorithmsquickly identify suspicious activity within the sensed network state. The GMID approach provides new capabilities for

* Information listed above is at the time of submission. *

US Flag An Official Website of the United States Government