<italic style="font-style: italic">k</italic> -Dimensional hashing scheme for hard disk integrity verification in computer forensics<italic style="font-style: italic">∗</italic>

Lin JIANG; Jun-bin FANG; Chi Kwong HUI; Ming YIU; Pui CHOW; Meng-meng SHENG

doi:10.1631/jzus.C1000425

Your Location：

Home >

Browse articles >

k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗

计算机与自动化 | Updated：2022-08-31

- k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗
- k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗
- 信息与电子工程前沿（英文） 2011年12卷第10期页码：809-818
- Affiliations：
  
  1.School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, Shenzhen 518055, China
  2.Department of Computer Science, The University of Hong Kong, Hong Kong, China
- Author bio：
  
  E-mail:zoeljiang@gmail.com
  ‡Corresponding Author
- Funds：
- DOI：10.1631/jzus.C1000425
  中图分类号：
- 收稿：2010-12-11，
  
  修回：2011-09-01，
  
  录用：2011-03-29，
  
  纸质出版：2011-10
- Accepted：
Scan QR Code
k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗[J]. 信息与电子工程前沿（英文）, 2011,12(10):809-818.

Lin JIANG, Jun-bin FANG, Chi Kwong HUI, et al. k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(10): 809-818.
k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗[J]. 信息与电子工程前沿（英文）, 2011,12(10):809-818. DOI： 10.1631/jzus.C1000425.

Lin JIANG, Jun-bin FANG, Chi Kwong HUI, et al. k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(10): 809-818. DOI： 10.1631/jzus.C1000425.

摘要

Abstract

Verifying the integrity of a hard disk is an important concern in computer forensics

as the law enforcement party needs to conﬁrm that the data inside the hard disk have not been modiﬁed during the investigation. A typical approach is to compute a single chained hash value of all sectors in a speciﬁc order. However

this technique loses the integrity of all other sectors even if only one of the sectors becomes a bad sector occasionally or is modiﬁed intentionally. In this paper we propose a

-dimensional hashing scheme

D for short

to distribute sectors into a

D space

and to calculate multiple hash values for sectors in

dimensions as integrity evidence. Since the integrity of the sectors can be veriﬁed depending on any hash value calculated using the sectors

the probability to verify the integrity of unchanged sectors can be high even with bad/modiﬁed sectors in the hard disk. We show how to eﬃciently implement this

D hashing scheme such that the storage of hash values can be reduced while increasing the chance of an unaﬀected sector to be veriﬁed successfully. Experimental results of a 3D scheme show that both the time for computing the hash values and the storage for the hash values are reasonable.

关键词

Keywords

references

浏览量

Downloads

CSCD

文章被引用时，请邮件提醒。

Submit

工具集

关联资源

暂无数据

k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗

k -Dimensional hashing scheme for hard disk integrity verification in computer forensics∗

DOI：10.1631/jzus.C1000425

摘要

Abstract

关键词

Keywords

references