Abstract
This paper proposes an anomaly-based Intrusion Detection System (IDS), which flags anomalous network traffic with a distance-based classifier. A polynomial approach was designed and applied in this work to extract hidden correlations from traffic related statistics in order to provide distinguishing features for detection. The proposed IDS was evaluated using the well-known KDD Cup 99 data set. Evaluation results show that the proposed system achieved better detection rates on KDD Cup 99 data set in comparison with another two state-of-the-art detection schemes. Moreover, the computational complexity of the system has been analysed in this paper and shows similar to the two state-of-the-art schemes.
| Original language | English |
|---|---|
| Title of host publication | 2017 IEEE Trustcom/BigDataSE/ICESS: Proceedings of the 16th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, the 11th IEEE International Conference on Big Data Science and Engineering, and the 14th IEEE International Conference on Embedded Software and Systems, 1-4 August 2017, Sydney, Australia |
| Publisher | IEEE |
| Pages | 978-983 |
| Number of pages | 6 |
| ISBN (Print) | 9781509049059 |
| DOIs | |
| Publication status | Published - 2017 |
| Event | IEEE International Conference on Trust_Security and Privacy in Computing and Communications - Duration: 1 Aug 2017 → … |
Conference
| Conference | IEEE International Conference on Trust_Security and Privacy in Computing and Communications |
|---|---|
| Period | 1/08/17 → … |
Keywords
- computational complexity
- intrusion detection systems (computer security)
- polynomials