Abstract
Network forensics is a discipline of growing importance. The ability to mathematically evaluate network intrusion incidents can substantially improve investigations. Graph theory is a robust mathematical tool that is readily applied to network traffic and has had been used in a limited fashion for network forensics. However, the full scope of graph theory has not previously been applied to network forensics. In particular, spectral graph theory has not been previously utilized for analyzing network forensics. This paper describes the application of spectral graph theory to specific network intrusion issues. This provides a mathematical tool to be utilized in network forensics. A case study is also utilized to demonstrate precisely how the methodology described in this paper should but utilized in an actual case.
| Original language | English |
|---|---|
| Title of host publication | 2021 IEEE 11th Annual Computing and Communication Workshop and Conference, CCWC 2021 |
| Editors | Rajashree Paul |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 846-852 |
| Number of pages | 7 |
| ISBN (Electronic) | 9781665414906 |
| ISBN (Print) | 9781665430586 |
| DOIs | |
| Publication status | Published - 17 Mar 2021 |
| Event | 11th IEEE Annual Computing and Communication Workshop and Conference - Virtual, Las Vegas, United States Duration: 27 Jan 2021 → 30 Jan 2021 |
Conference
| Conference | 11th IEEE Annual Computing and Communication Workshop and Conference |
|---|---|
| Abbreviated title | CCWC 2021 |
| Country/Territory | United States |
| City | Virtual, Las Vegas |
| Period | 27/01/21 → 30/01/21 |
Keywords
- Cheeger constant
- graph Laplacian
- network forensics
- Spectral Graph theory