Forensic analysis of B-tree file system (Btrfs)

被引:9
|
作者
Bhat, Wasim Ahmad [1 ]
Wani, Mohamad Ahtisham [1 ]
机构
[1] Univ Kashmir, Dept Comp Sci, Srinagar, Jammu & Kashmir, India
关键词
Btrfs; B-Tree; Forensic artifacts; Evidence-extraction; Node-balancing;
D O I
10.1016/j.diin.2018.09.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper identifies forensically important artifacts of B-tree file system (Btrfs), analyses changes that they incur due to node-balancing during file and directory operations, and based on the observed file system state-change proposes an evidence-extraction procedure. The findings suggested that retrieving forensic evidence in a fresh B-tree file system is difficult, the probability of evidence-extraction increases as the file system ages, internal nodes are the richest sources of forensic data, degree of evidence-extraction depends upon whether nodes are merged or redistributed, files with size less than 1 KB and greater than 4 KB have highest chances of recovery, and files with size 3-4 KB have least chances of recovery. (C) 2018 Elsevier Ltd. All rights reserved.
引用
收藏
页码:57 / 70
页数:14
相关论文
共 50 条