Network entity characterization and attack prediction

被引:27
作者
Bartos, Vaclav [1 ]
Zadnik, Martin [2 ]
Habib, Sheikh Mahbub [3 ]
Vasilomanolakis, Emmanouil [4 ]
机构
[1] CESNET, Prague, Czech Republic
[2] CESNET, Czech Natl Res & Educ Network, Prague, Czech Republic
[3] Continental AG, Secur & Privacy Competence Ctr SCC, Hannover, Germany
[4] Aalborg Univ, Ctr Commun Media & Informat Technol, Aalborg, Denmark
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2019年 / 97卷
基金
欧盟地平线“2020”;
关键词
Network security; Alert sharing; Reputation database; Attack prediction; Alert prioritization; Machine learning;
D O I
10.1016/j.future.2019.03.016
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The devastating effects of cyber-attacks, highlight the need for novel attack detection and prevention techniques. Over the last years, considerable work has been done in the areas of attack detection as well as in collaborative defense. However, an analysis of the state of the art suggests that many challenges exist in prioritizing alert data and in studying the relation between a recently discovered attack and the probability of it occurring again. In this article, we propose a system that is intended for characterizing network entities and the likelihood that they will behave maliciously in the future. Our system, namely Network Entity Reputation Database System (NERDS), takes into account all the available information regarding a network entity (e. g. IP address) to calculate the probability that it will act maliciously. The latter part is achieved via the utilization of machine learning. Our experimental results show that it is indeed possible to precisely estimate the probability of future attacks from each entity using information about its previous malicious behavior and other characteristics. Ranking the entities by this probability has practical applications in alert prioritization, assembly of highly effective blacklists of a limited length and other use cases. (C) 2019 Elsevier B.V. All rights reserved.
引用
收藏
页码:674 / 686
页数:13
相关论文
共 29 条
  • [1] [Anonymous], CSUR
  • [2] [Anonymous], 2010, TECH REP
  • [3] Bartog V., 2016, 12016 CESNET
  • [4] Evaluating Reputation of Internet Entities
    Bartos, Vaclav
    Korenek, Jan
    [J]. MANAGEMENT AND SECURITY IN THE AGE OF HYPERCONNECTIVITY, AIMS 2016, 2016, 9701 : 132 - 136
  • [5] Bartos V, 2014, IEEE INT WORKSH COMP, P305, DOI 10.1109/CAMAD.2014.7033255
  • [6] CESNET Association, WARDEN AL SHAR SYST
  • [7] SMOTE: Synthetic minority over-sampling technique
    Chawla, Nitesh V.
    Bowyer, Kevin W.
    Hall, Lawrence O.
    Kegelmeyer, W. Philip
    [J]. 2002, American Association for Artificial Intelligence (16)
  • [8] Collins MP, 2007, IMC'07: PROCEEDINGS OF THE 2007 ACM SIGCOMM INTERNET MEASUREMENT CONFERENCE, P93
  • [9] Calibrating Probability with Undersampling for Unbalanced Classification
    Dal Pozzolo, Andrea
    Caelen, Olivier
    Johnson, Reid A.
    Bontempi, Gianluca
    [J]. 2015 IEEE SYMPOSIUM SERIES ON COMPUTATIONAL INTELLIGENCE (IEEE SSCI), 2015, : 159 - 166
  • [10] Dulaunoy A., 2018, NETW C TNC 18