Identifying Attack Propagation Patterns in Honeypots using Markov Chains Modeling and Complex Networks Analysis

被引:27
作者
Bar, Ariel [1 ]
Shapira, Bracha
Rokach, Lior
Unger, Moshe
机构
[1] Ben Gurion Univ Negev, Dept Informat Syst Engn, Beer Sheva, Israel
来源
2016 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE SCIENCE, TECHNOLOGY AND ENGINEERING (SWSTE 2016) | 2016年
关键词
Cyber Security; Honeypots; Attack Propagation; Markov Chains; Complex Networks Analysis;
D O I
10.1109/SWSTE.2016.13
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Honeypots are computer resources that are used to detect and deflect network attacks on a protected system. The data collected from honeypots can be utilized to better understand cyber-attacks and provide insights for improving security measures, such as intrusion detection systems. In recent years, attackers' sophistication has increased significantly, thus additional and more advanced analytical models are required. In this paper we suggest several unique methods for detecting attack propagation patterns using Markov Chains modeling and complex networks analysis. These methods can be applied on attack datasets collected from honeypots. The results of these models shed light on different attack profiles and interaction patterns between the deployed sensors in the honeypot system. We evaluate the suggested methods on a massive data set which includes over 167 million observed attacks on a globally distributed honeypot system. Analyzing the results reveals interesting patterns regarding attack correlations between the honeypots. We identify central honeypots which enable the propagation of attacks, and present how attack profiles may vary according to the attacking country. These patterns can be used to better understand existing or evolving attacks, and may aid security experts to better deploy honeypots in their system.
引用
收藏
页码:28 / 36
页数:9
相关论文
共 17 条
[1]  
[Anonymous], 2006, WORKSH EMP EV DEP SE
[2]  
[Anonymous], 2012, Introduction to probability
[3]   Fast unfolding of communities in large networks [J].
Blondel, Vincent D. ;
Guillaume, Jean-Loup ;
Lambiotte, Renaud ;
Lefebvre, Etienne .
JOURNAL OF STATISTICAL MECHANICS-THEORY AND EXPERIMENT, 2008,
[4]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308
[5]   A faster algorithm for betweenness centrality [J].
Brandes, U .
JOURNAL OF MATHEMATICAL SOCIOLOGY, 2001, 25 (02) :163-177
[6]  
Bringer Matthew L., 2012, INT J COMPUT NETW IN, V4, P10, DOI DOI 10.5815/IJCNIS.2012.10.07
[7]  
Chen Lin, 2009, PAR DISTR PROC APPL
[8]  
Dantu R, 2007, IEEE T DEPEND SECURE, V4, P119, DOI [10.1109/Tait2007.1002, 10.1109/TDSC.2007.1002]
[9]   Characterization and classification of malicious Web traffic [J].
Goseva-Popstojanova, Katerina ;
Anastasovski, Goce ;
Dimitrijevikj, Ana ;
Pantev, Risto ;
Miller, Brandon .
COMPUTERS & SECURITY, 2014, 42 :92-115
[10]  
Goseva-Popstojanova Katerina, 2010, NETW COMP APPL NCA 2