Integrity check method for fine-grained data

被引：2

作者：

School of Information Science and Technology, Southwest Jiaotong University, Chengdu 610031, China ^{[1
]}

不详 ^{[2
]}

机构：

[1] School of Information Science and Technology, Southwest Jiaotong University

[2] Institute of Computer Science and Technology, Chongqing University of Posts and Telecommunications

来源：

Ruan Jian Xue Bao | 2009年 / 4卷 / 902-909期

关键词：

Computer forensics; Data integrity; Error correction coding; Forensic duplication; Hash;

D O I：

10.3724/SP.J.1001.2009.03394

中图分类号：

学科分类号：

摘要：

Fine-Grained integrity check for forensic data becomes an important demand of computer forensics. It will mitigate the disasterous effect on the data by some random errors or the intentional forging modification. Unfortunately, the traditional method generates a hash for every piece of small data and produces a large amount of hash data. These hash data are random data and can not be compressed in a normal way. It has a great negative impact on storing hash data and transmitting them over network. Based on the error correction coding theory, a fine-grained integrity check method, an integrity indication code, is proposed. The properties of the integrity indication code are analyzed. Combinatorial codes for one error in a group of data objects are also proposed. Hash data can be compressed hundredfold using combinatorial codes. This paper provides a fundamental support for further research on fine-grain data integrity check method and related applications. © by Institute of Software, the Chinese Academy of Sciences.

引用

页码：902 / 909

页数：7

共 9 条

[1]

Richard III G.G., Roussev V., Next-Generation digital forensics, Communications of the ACM, 49, 2, pp. 76-80, (2006)

[2]

Wang L., Qian H.L., Computer forensics and its future trend, Journal of Software, 14, 9, pp. 1635-1644, (2003)

[3]

Ding L.P., Wang Y.J., Study on relevant law and technology issues about computer forensics, Journal of Software, 16, 2, pp. 260-275, (2005)

[4]

Kornblum J., Identifying almost identical files using context triggered piecewise hashing, Digital Investigation, 3, S1, pp. 91-97, (2006)

[5]

Chen L., Wang G.Y., An efficient piecewise hashing method for computer forensics, Proc. of the Int'l Workshop on Knowledge Discovery and Data Mining, pp. 635-638, (2008)

[6]

Roussev V., Chen Y.X., Bourg T., Richard III G.G., Md5bloom: Forensic filesystem hashing revisited, Digital Investigation, 3, S1, pp. 82-90, (2006)

[7]

Roussev V., Richard III G.G., Marziale L., Multi-Resolution similarity hashing, Digital Investigation, 4, S1, pp. 105-113, (2007)

[8]

Jin F., Chen Z., Combinatorial Coding Theory and its Applications, (1995)

[9]

Bose R., Information Theory, Coding and Cryptography, (2003)

← 1 →