An Adaptive Threshold Method for Anomaly-based Intrusion Detection Systems

被引:5
作者
Chae, Younghun [1 ]
Katenka, Natallia [2 ]
DiPippo, Lisa [2 ]
机构
[1] Kent State Univ, Dept Comp Sci, North Canton, OH 44720 USA
[2] Univ Rhode Isl, Dept Comp Sci & Stat, Kingston, RI 02881 USA
来源
2019 IEEE 18TH INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS (NCA) | 2019年
关键词
Anomaly Detection; Intrusion; Trust; Statistics; Bipartite Graph; Network Security; Cybersecurity;
D O I
10.1109/nca.2019.8935045
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Anomaly-based Detection Systems (ADSs) attempt to learn the features of behaviors and events of a system and/or users over a period to build a profile of normal behaviors. There has been a growing interest in ADSs and typically conceived as more powerful systems One of the important factors for ADSs is an ability to distinguish between normal and abnormal behaviors in a given period. However, it is getting complicated due to the dynamic network environment that changes every minute. It is dangerous to distinguish between normal and abnormal behaviors with a fixed threshold in a dynamic environment because it cannot guarantee the threshold is always an indication of normal behaviors. In this paper, we propose an adaptive threshold for a dynamic environment with a trust management scheme for efficiently managing the profiles of normal and abnormal behaviors. Based on the assumption of the statistical analysis-based ADS that normal data instances occur in high probability regions while malicious data instances occur in low probability regions of a stochastic model, we set two adaptive thresholds for normal and abnormal behaviors. The behaviors between the two thresholds are classified as suspicious behaviors, and they are efficiently evaluated with a trust management scheme.
引用
收藏
页码:221 / 224
页数:4
相关论文
共 15 条
[1]  
[Anonymous], 2002, Proceedings of ACM International Symposium on Mobile Ad Hoc Net-working and Computing (MobiHoc)
[2]  
[Anonymous], 2009, P 2 IEEE S COMP INT
[3]  
[Anonymous], LAERD STAT
[4]  
Aydin M. A., 2009, COMPUT ELECT ENG
[5]  
Chae Y., 2012, Redeemable Reputation based Secure Routing Protocol for Wireless Sensor Networks
[6]  
Chae Y., 2014, PARALLEL DISTRIB SYS, V26, P1
[7]  
Chae Y, 2016, INT CONF DAT MIN WOR, P281, DOI [10.1109/ICDMW.2016.58, 10.1109/ICDMW.2016.0047]
[8]   An improved data stream summary: the count-min sketch and its applications [J].
Cormode, G ;
Muthukrishnan, S .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 55 (01) :58-75
[9]  
Ding Q., 2012, P 18 ACM SIGKDD INT, P886, DOI DOI 10.1145/2339530.2339670
[10]  
Hamel L.H., 2011, Knowledge Discovery with Support Vector Machines