Date of Award
5-2019
Culminating Project Type
Thesis
Degree Name
Information Assurance: M.S.
Department
Information Assurance and Information Systems
College
Herberger School of Business
First Advisor
Dennis Guster
Second Advisor
Jim Chen
Third Advisor
Changsoo Sohn
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Keywords and Subject Headings
Graph Database Incident Response Network Problem
Abstract
The network complexity problem within computer security incident response is an issue pertaining to the complexity of a computer network as it grows in both size and scale. The larger the computer network grows, the more difficult reconnaissance becomes, which is necessary to execute correction and prevention measures that address issues that arise during security incident response. Leveraging graph databases can help solve problems present in relational databases with large, tree-like structures, like those present in computer networks, and along with solving those problems adds flexibility that is needed due to the mutability of computer networks. This paper focuses on using graph databases to discover the blast radius of day zero vulnerabilities on the fly by using the properties of graph databases to find intuitive infection vectors that may be present during a day zero vulnerability. Additionally, options for visualizing security data in ways that make the data more actionable will be explored.
Recommended Citation
Erickson, Andrew, "Using Graph Databases to Address Network Complexity Problems that can Hinder Security Incident Response" (2019). Culminating Projects in Information Assurance. 88.
https://repository.stcloudstate.edu/msia_etds/88
