Efficient Host Intrusion Detection using Hyperdimensional Computing
Modern host-based intrusion detection systems (HIDS) rely on querying provenance graphs—graph representations of activity history on a system—to detect and respond to security threats present on a system. However, as the complexity and number of applications running on a system increase, the size of provenance graphs also increase, and thus the latency to query them. State-of-the-art designs deliver query latencies that are impractical for modern threat detection. In this paper, we introduce a hyper-dimensional computing (HDC) approach to querying provenance graphs for HIDS. By encoding provenance graphs and attack patterns/signatures into hyper-dimensional vectors, we can implement a query engine using simple vector operations. Our approach is hardware accelerator compatible, providing further speedups under resource-constrained environments. Our evaluation on a real-world dataset shows that our approach achieves > 90% detection accuracy and up to 4, 242× speedups over the state-of-the-art. This shows that HDC-based approaches can effectively deal with scaling issues in modern HIDS.
Authors
- Quinn Burke (ORCID: https://orcid.org/0000-0003-1719-3112)
- Minxuan Zhou (ORCID: https://orcid.org/0000-0002-5523-7270)
- Patrick McDaniel (ORCID: https://orcid.org/0000-0003-2091-7484)
- Yujin Nam (ORCID: https://orcid.org/0000-0003-4627-1634)
- Rachel King (ORCID: https://orcid.org/0000-0002-0085-3498)
- Tajana Rosing
Institutions
- University of Wisconsin–Madison (US)
- Illinois Institute of Technology (US)
- University of California San Diego (US)
Publication Details
- Published
- 2024-12-15
- DOI
- https://doi.org/10.1109/bigdata62323.2024.10825247
- Citations
- 1
- Primary Topic
- Ferroelectric and Negative Capacitance Devices
- Type
- article
- Field-Weighted Citation Impact
- 0.21