A survey and research challenges of anti-forensics: Evaluation of game-theoretic models in simulation of forensic agents' behaviour

被引:4
作者
Hasanabadi, Saeed Shafiee [1 ]
Lashkari, Arash Habibi [1 ]
Ghorbani, Ali A. [1 ]
机构
[1] Univ New Brunswick UNB, Canadian Inst Cybersecur, Fredericton, NB, Canada
来源
FORENSIC SCIENCE INTERNATIONAL-DIGITAL INVESTIGATION | 2020年 / 35卷
关键词
Anti-forensics; Counter-anti-forensics; Digital forensics; Forensic environment; Game theory; Fictitious play; Gradient play; Bayesian game theory; Evolutionary game theory; STACKELBERG GAMES; MEMORY FORENSICS; FICTITIOUS PLAY; ACQUISITION; QUALITY;
D O I
10.1016/j.fsidi.2020.301024
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Digital forensic investigators' aim is identifying, collecting and presenting reliable, accurate, and admissible evidence in court. However, anti-forensics manipulate, obfuscate, hide, and remove the remaining piece of evidence in a compromised system. Anti-forensics interrupt investigation procedures; thus, the investigators require specific defensive strategies (counter-anti-forensics) against antiforensics. This paper mounts a survey to explore existing anti-forensic research, and constitute a taxonomy on behaviour of anti-forensics and another taxonomy on further research tasks of anti-forensics. The knowledge of interactions between forensic agents' (an investigator and an attacker) in a forensic environment helps the investigator to evaluate the existing counter-anti-forensics, and enables him/her to design and develop more advanced counter-anti-forensics. Therefore, in this paper, first, we formulate a set of characteristics to model interactions between the attacker and the investigator (players) in a realistic forensic environment. Next, we propose a game-theoretic approach to model the players' interactions. The attacker uses anti-forensics (i.e. rootkits) and the investigator employs counter-antiforensics (i.e. anti-rootkits). We select and evaluate a set of game-theoretic models and algorithms to simulate the players' interactions. Results of the evaluation show that a gradient play algorithm has satisfactory performance, among the selected game-theoretic models and algorithms to simulate the interactions in the forensic environment. The gradient play algorithm identifies the investigator's most stable and desired strategies after spending 10.0E-4 s and consuming 5.8 KB. (C) 2020 Elsevier Ltd. All rights reserved.
引用
收藏
页数:16
相关论文
共 134 条
[1]   Markov equilibria in a model of bargaining in networks [J].
Abreu, Dilip ;
Manea, Mihai .
GAMES AND ECONOMIC BEHAVIOR, 2012, 75 (01) :1-16
[2]   Intrusion detection in sensor networks: A non-cooperative game approach [J].
Agah, A ;
Das, SK ;
Basu, K ;
Asadi, M .
THIRD IEEE INTERNATIONAL SYMPOSIUM ON NETWORK COMPUTING AND APPLICATIONS, PROCEEDINGS, 2004, :343-346
[3]  
Al-Saleh MI, 2017, INT J ELECTRON SECUR, V9, P167
[4]   Development of a tampering dataset for forensic investigation [J].
Al-Sanjary, Omar Ismael ;
Ahmed, Ahmed Abdullah ;
Sulong, Ghazali .
FORENSIC SCIENCE INTERNATIONAL, 2016, 266 :565-572
[5]  
Albano P., 2011, 2011 International Conference on Broadband, Wireless Computing, Communication and Applications, P380, DOI 10.1109/BWCCA.2011.62
[6]   A game theoretic analysis of intrusion detection in access control systems [J].
Alpcan, T ;
Basar, T .
2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, :1568-1573
[7]  
Annis J., 2008, 22 OP U
[8]  
[Anonymous], 2000, TECHNICAL REPORT
[9]  
[Anonymous], 2006, 12 INT S DYNAMIC GAM
[10]  
[Anonymous], 2008, 13 INT S DYN GAM APP