arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.03768cs.AIcs.MA
收藏

Catch Me If You Can:Improving Advertisements in Cyber-Security With Q-学习算法

Catch Me If You Can: Improving Adversaries in Cyber-Security With Q-Learning Algorithms

Czech Technical University(捷克技术大学)

Arti Bandhana, Ondřej Lukáš, Sebastian Garcia, Tomáš Kroupa

摘要:

网络攻击的不断增加以及网络安全领域缺乏熟练的专业人员来打击这些攻击,表明需要能够检测具有良好性能的攻击的自动化工具。攻击者会伪装自己的行为,并发起由多个行为组成的攻击,这些行为很难被发现。因此,改进防御工具需要针对训练有素的攻击者进行校准。在这项工作中,我们提出了一个攻击代理和环境的模型,并使用基本Q学习,朴素Q学习和DoubleQ学习来评估其性能,所有这些都是Q学习的变体。攻击代理的训练目标是泄露数据,从而使网络中的所有主机都具有非零的检测概率。结果表明,DoubleQ学习代理具有最好的整体性能率,成功地实现了目标,在$70\%$的互动。

英文摘要:

The ongoing rise in cyberattacks and the lack of skilled professionals in the cybersecurity domain to combat these attacks show the need for automated tools capable of detecting an attack with good performance. Attackers disguise their actions and launch attacks that consist of multiple actions, which are difficult to detect. Therefore, improving defensive tools requires their calibration against a well-trained attacker. In this work, we propose a model of an attacking agent and environment and evaluate its performance using basic Q-Learning, Naive Q-learning, and DoubleQ-Learning, all of which are variants of Q-Learning. The attacking agent is trained with the goal of exfiltrating data whereby all the hosts in the network have a non-zero detection probability. Results show that the DoubleQ-Learning agent has the best overall performance rate by successfully achieving the goal in $70\%$ of the interactions.

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

↑