Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2408.09788 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911993880903680 |
|---|---|
| author | von Westenholz, Mandala Atzmueller, Martin Römer, Tim |
| author_facet | von Westenholz, Mandala Atzmueller, Martin Römer, Tim |
| contents | For studying intrusion detection data we consider data points referring to individual IP addresses and their connections: We build networks associated with those data points, such that vertices in a graph are associated via the respective IP addresses, with the key property that attacked data points are part of the structure of the network. More precisely, we propose a novel approach using simplicial complexes to model the desired network and the respective intrusions in terms of simplicial attributes thus generalizing previous graph-based approaches. Adapted network centrality measures related to simplicial complexes yield so-called patterns associated to vertices, which themselves contain a set of features. These are then used to describe the attacked or the attacker vertices, respectively. Comparing this new strategy with classical concepts demonstrates the advantages of the presented approach using simplicial features for detecting and characterizing intrusions. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_09788 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Simplicial complexes in network intrusion profiling von Westenholz, Mandala Atzmueller, Martin Römer, Tim Commutative Algebra Cryptography and Security Primary: 05E45, 68R05, Secondary: 05C82, 68R10 For studying intrusion detection data we consider data points referring to individual IP addresses and their connections: We build networks associated with those data points, such that vertices in a graph are associated via the respective IP addresses, with the key property that attacked data points are part of the structure of the network. More precisely, we propose a novel approach using simplicial complexes to model the desired network and the respective intrusions in terms of simplicial attributes thus generalizing previous graph-based approaches. Adapted network centrality measures related to simplicial complexes yield so-called patterns associated to vertices, which themselves contain a set of features. These are then used to describe the attacked or the attacker vertices, respectively. Comparing this new strategy with classical concepts demonstrates the advantages of the presented approach using simplicial features for detecting and characterizing intrusions. |
| title | Simplicial complexes in network intrusion profiling |
| topic | Commutative Algebra Cryptography and Security Primary: 05E45, 68R05, Secondary: 05C82, 68R10 |
| url | https://arxiv.org/abs/2408.09788 |