MABAT: A Multi-Armed Bandit Approach for Threat-Hunting

被引:5
作者
Dekel, Liad [1 ,2 ]
Leybovich, Ilia [1 ,2 ]
Zilberman, Polina [1 ]
Puzis, Rami [1 ,2 ]
机构
[1] Cyber BGU Labs, IL-8410501 Beer sheva, Israel
[2] Ben Gurion Univ Negev, Dept Software & Informat Syst Engn, IL-8410501 Beer sheva, Israel
基金
新加坡国家研究基金会;
关键词
Digital forensics; computer security; threat hunting; threat intelligence; reinforcement learning;
D O I
10.1109/TIFS.2022.3215010
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Threat hunting relies on cyber threat intelligence to perform active hunting of prospective attacks instead of waiting for an attack to trigger some pre-configured alerts. One of the most important aspects of threat hunting is automation, especially when it concerns targeted data collection. Multi-armed bandits (MAB) is a family of problems that can be used to optimize the targeted data collection and balance between exploration and exploitation of the collected data. Unfortunately, state-of-the-art policies for solving MAB with dependent arms do not utilize the detailed interrelationships between attacks such as telemetry or artifacts shared by multiple attacks. We propose new policies, one of which is theoretically proven, to prioritize the investigated attacks during targeted data collection. Experiments with real data extracted from VirusTotal behavior reports show the superiority of the proposed techniques and their robustness in presence of noise.
引用
收藏
页码:477 / 490
页数:14
相关论文
共 39 条
[1]  
Agrawal S., 2012, COLT
[2]  
Alonso S, 2016, Cyber threat hunting (1): Intro
[3]   Exploration-exploitation tradeoff using variance estimates in multi-armed bandits [J].
Audibert, Jean-Yves ;
Munos, Remi ;
Szepesvari, Csaba .
THEORETICAL COMPUTER SCIENCE, 2009, 410 (19) :1876-1902
[4]   Finite-time analysis of the multiarmed bandit problem [J].
Auer, P ;
Cesa-Bianchi, N ;
Fischer, P .
MACHINE LEARNING, 2002, 47 (2-3) :235-256
[5]   Bandits with Knapsacks (Extended Abstract) [J].
Badanidiyuru, Ashwinkumar ;
Kleinberg, Robert ;
Slivkins, Aleksandrs .
2013 IEEE 54TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2013, :207-216
[6]  
Bouwman X, 2020, PROCEEDINGS OF THE 29TH USENIX SECURITY SYMPOSIUM, P433
[7]  
Brewer R, 2019, COMPUT FRAUD SECUR, P8, DOI [10.1016/s1361-3723(19)30106-x, 10.1016/S1361-3723(19)30106-X]
[8]   Multi-Armed Recommender System Bandit Ensembles [J].
Canamares, Rocio ;
Redondo, Marcos ;
Castells, Pablo .
RECSYS 2019: 13TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, 2019, :432-436
[9]  
Chen Wei., 2013, INT C MACHINE LEARNI, P151
[10]  
Crowdstrike, 2019, CROWDSTRIKE FALCON O