Show simple item record

dc.contributor.authorCiardhuáin, Séamus Ó
dc.contributor.authorFernandes, Pedro
dc.contributor.authorAntunes, Mário
dc.date.accessioned2025-01-09T14:19:17Z
dc.date.available2025-01-09T14:19:17Z
dc.date.copyright2024
dc.date.issued2024-07-23
dc.identifier.citationFernandes, P., Ciardhuáin, S. Ó. and Antunes, M. (2024) 'Unveiling Malicious Network Flows Using Benford’s Law'. Mathematics, 12(15), 2299. Available at: https://doi.org/10.3390/math12152299en_US
dc.identifier.urihttps://research.thea.ie/handle/20.500.12065/4889
dc.description.abstractThe increasing proliferation of cyber-attacks threatening the security of computer networks has driven the development of more effective methods for identifying malicious network flows. The inclusion of statistical laws, such as Benford’s Law, and distance functions, applied to the first digits of network flow metadata, such as IP addresses or packet sizes, facilitates the detection of abnormal patterns in the digits. These techniques also allow for quantifying discrepancies between expected and suspicious flows, significantly enhancing the accuracy and speed of threat detection. This paper introduces a novel method for identifying and analyzing anomalies within computer networks. It integrates Benford’s Law into the analysis process and incorporates a range of distance functions, namely the Mean Absolute Deviation (MAD), the Kolmogorov–Smirnov test (KS), and the Kullback–Leibler divergence (KL), which serve as dispersion measures for quantifying the extent of anomalies detected in network flows. Benford’s Law is recognized for its effectiveness in identifying anomalous patterns, especially in detecting irregularities in the first digit of the data. In addition, Bayes’ Theorem was implemented in conjunction with the distance functions to enhance the detection of malicious traffic flows. Bayes’ Theorem provides a probabilistic perspective on whether a traffic flow is malicious or benign. This approach is characterized by its flexibility in incorporating new evidence, allowing the model to adapt to emerging malicious behavior patterns as they arise. Meanwhile, the distance functions offer a quantitative assessment, measuring specific differences between traffic flows, such as frequency, packet size, time between packets, and other relevant metadata. Integrating these techniques has increased the model’s sensitivity in detecting malicious flows, reducing the number of false positives and negatives, and enhancing the resolution and effectiveness of traffic analysis. Furthermore, these techniques expedite decisions regarding the nature of traffic flows based on a solid statistical foundation and provide a better understanding of the characteristics that define these flows, contributing to the comprehension of attack vectors and aiding in preventing future intrusions. The effectiveness and applicability of this joint method have been demonstrated through experiments with the CICIDS2017 public dataset, which was explicitly designed to simulate real scenarios and provide valuable information to security professionals when analyzing computer networks. The proposed methodology opens up new perspectives in investigating and detecting anomalies and intrusions in computer networks, which are often attributed to cyber-attacks. This development culminates in creating a promising model that stands out for its effectiveness and speed, accurately identifying possible intrusions with an F1 of nearly (Formula presented.), a recall of (Formula presented.), and an accuracy of (Formula presented.).en_US
dc.formatapplication/pdfen_US
dc.language.isoengen_US
dc.publisherMDPIen_US
dc.relation.ispartofMathematicsen_US
dc.rightsAttribution 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/*
dc.subjectBenford’s Lawen_US
dc.subjectflow analysisen_US
dc.subjectKullback–Leibler divergenceen_US
dc.subjectmean absolute deviationen_US
dc.subjectnetwork trafficen_US
dc.subjectstatistical analysisen_US
dc.titleUnveiling Malicious Network Flows Using Benford’s Lawen_US
dc.typeinfo:eu-repo/semantics/articleen_US
dc.contributor.affiliationTechnological University of the Shannon: Midlands Midwesten_US
dc.description.peerreviewyesen_US
dc.identifier.doi10.3390/math12152299en_US
dc.identifier.eissn2227-7390
dc.identifier.issue15en_US
dc.identifier.orcidhttps://orcid.org/0000-0002-3207-8668en_US
dc.identifier.startpage2299en_US
dc.identifier.volume12en_US
dc.rights.accessrightsinfo:eu-repo/semantics/openAccessen_US
dc.subject.departmentDepartment of Information Technologyen_US
dc.type.versioninfo:eu-repo/semantics/publishedVersionen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record

Attribution 4.0 International
Except where otherwise noted, this item's license is described as Attribution 4.0 International