An Automated Malicious Host Recognition Model in Cloud Forensics

被引:1
作者
Datta, Suchana [1 ]
Santra, Palash [1 ]
Majumder, Koushik [1 ]
De, Debashis [1 ]
机构
[1] Maulana Abul Kalam Azad Univ Technol, Dept Comp Sci & Engn, Kolkata, India
来源
NETWORKING COMMUNICATION AND DATA KNOWLEDGE ENGINEERING, VOL 2 | 2018年 / 4卷
关键词
Cloud forensics; Principal component analysis; Boosting; Malicious actor identifier;
D O I
10.1007/978-981-10-4600-1_6
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Cloud forensics is the new emerging science where traditional digital forensics methodology and cloud computational intelligence have been blended in such a way that all the malicious cloud criminals can be identified and punished in a justified manner. The distributed and black-box architecture of the cloud has faded the concept of examining each and every local host to identify proper malicious actors. Here, an obvious demand of an automated criminal recognition model has come into play. This paper mainly focuses on this legitimate demand of cloud forensic investigators by proposing a Cloud Malicious Actor Identifier model. This model identifies the malicious actors related to a particular crime scene and ranks them according to their probability of being malicious using a very well-known machine learning technique, Boosting. The main purpose of this model is to mitigate the overhead of probing each and every IP address while investigation. The performance evaluation of the proposed model has also been explained with logical explanation and achieved output.
引用
收藏
页码:61 / 71
页数:11
相关论文
共 13 条
[1]  
Accorsi R., 2012, ERCIM NEWS, V90
[2]  
[Anonymous], 2014, NIST CLOUD COMPUTING
[3]  
[Anonymous], ENCY STAT SCI
[4]  
[Anonymous], 2013, EMERG DIG FORENSICS
[5]  
[Anonymous], 2012, PRINCIPAL COMPONENT
[6]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[7]   An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization [J].
Dietterich, TG .
MACHINE LEARNING, 2000, 40 (02) :139-157
[8]   Greedy function approximation: A gradient boosting machine [J].
Friedman, JH .
ANNALS OF STATISTICS, 2001, 29 (05) :1189-1232
[9]   Stochastic gradient boosting [J].
Friedman, JH .
COMPUTATIONAL STATISTICS & DATA ANALYSIS, 2002, 38 (04) :367-378
[10]  
Hong Guo, 2012, Proceedings of the 2012 International Conference on Computer Science and Information Processing (CSIP), P248, DOI 10.1109/CSIP.2012.6308841