arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.08758cs.CR

基于广义熵进展差分分析的拒绝服务攻击检测

Denial-of-Service Attack Detection via Differential Analysis of Generalized Entropy Progressions

Omer Subasi, Joseph Manzano, Kevin Barker

AI总结:

本文提出一种基于广义熵进展差分分析的 DoS 攻击检测方法,通过拟合熵进展斜率并与动态标准差比较,无需阈值即可在五个真实数据集上以低假阳性率和低采样率实现高准确率与可扩展性。

摘要:

拒绝服务(DoS)攻击是计算机网络中最常见且后果最严重的网络攻击之一。尽管现有研究提供了大量的检测方法,但如何同时实现可扩展性和高检测准确率的问题仍未解决。在本工作中,我们通过开发一种基于广义熵进展的差分方法来解决这一问题。在该方法中,我们持续对熵进展拟合最佳拟合直线,并检查其导数,即该直线的斜率是否小于动态计算的导数标准差的负值。由此,我们省略了阈值的使用,并且在五个真实世界网络流量数据集上的结果证实,我们的方法平均优于基于阈值的 DoS 攻击检测两个数量级。我们的方法实现了最高 7% 的假阳性率,其中在使用 Tsallis 熵且仅对总网络流进行 5% 采样时,算术平均值为 3%。此外,由于我们方法的主要计算成本是熵计算,而熵计算与单位时间网络流量体积呈线性关系,并且仅使用整数运算和总流量的一小部分,因此该方法轻量且可扩展。

英文摘要:

Denial-of-Service (DoS) attacks are one of the most common and consequential cyber attacks in computer networks. While existing research offers a plethora of detection methods, the issue of achieving both scalability and high detection accuracy remains open. In this work, we address this problem by developing a differential method based on generalized entropy progression. In this method, we continuously fit the line of best fit to the entropy progression and check if the derivative, that is, the slope of this line is less than the negative of the dynamically computed standard deviation of the derivatives. As a result, we omit the usage of the thresholds and the results with five real-world network traffic datasets confirm that our method outperforms threshold-based DoS attack detection by two orders of magnitude on average. Our method achieves false positive rates that are up to 7% where the arithmetic mean is 3% with Tsallis entropy and only 5% sampling of the total network flow. Moreover, since the main computation cost of our method is the entropy computation, which is linear in the volume of the unit-time network flow and it uses integer only operations and a small fraction of the total flow, it is therefore lightweight and scalable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑