An Integrity Check Method for Fine-Grained Data
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [12]
  • |
  • Related [20]
  • |
  • Cited by [7]
  • | |
  • Comments
    Abstract:

    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 ofhash data. These hash data are random data and can not be compressed in a normal way. It has a great negativeimpact on storing hash data and transmitting them over network. Based on the error correction coding theory, afine-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.

    Reference
    [1] Golden G. Richard III, Roussev V. Next-Generation digital forensics. Communications of the ACM, 2006,49(2):76?80.
    [2] Wang L, Qian HL. Computer forensics and its future trend. Journal of Software, 2003,14(9):1635?1644 (in Chinese with Englishabstract). http://www.jos.org.cn/1000-9825/14/1635.htm
    [3] Ding LP, Wang YJ. Study on relevant law and technology issues about computer forensics. Journal of Software, 2005,16(2):260?275 (in Chinese with English abstract). http://www.jos.org.cn/1000-9825/16/260.htm
    [4] Kornblum J. Identifying almost identical files using context triggered piecewise hashing. Digital Investigation, 2006,3(s1):91?97.
    [5] Chen L, Wang GY. An efficient piecewise hashing method for computer forensics. In: Luo Q, Gong MM, Xiong F, Yu F, eds. Proc.of the Int’l Workshop on Knowledge Discovery and Data Mining. Adelaide: IEEE Comupter Society, 2008. 635?638.
    [6] Roussev V, Chen YX, Bourg T, Richard III GG. Md5bloom: Forensic filesystem hashing revisited. Digital Investigation, 2006,3(s1):82?90.
    [7] Roussev V, Richard III GG, Marziale L. Multi-Resolution similarity hashing. Digital Investigation, 2007,4(s1):105?113.
    [8] Jin F, Chen Z. Combinatorial Coding Theory and its Applications. Shanghai: Shanghai Scientific & Technical Publishers, 1995 (inChinese).
    [9] Bose R. Information Theory, Coding and Cryptography. Beijing: McGraw-Hill Education Co., China Machine Press, 2003. 附中文参考文献:
    [2] 王玲,钱华林.计算机取证技术及其发展趋势.软件学报,2003,14(9):1635?1644. http://www.jos.org.cn/1000-9825/14/1635.htm
    [3] 丁丽萍,王永吉.计算机取证的相关法律技术问题研究.软件学报,2005,16(2):260?275. http://www.jos.org.cn/1000-9825/16/260.htm
    [8] 靳番,陈志,编著.组合编码原理及应用.上海:上海科学技术出版社,1995.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

陈龙,王国胤.一种细粒度数据完整性检验方法.软件学报,2009,20(4):902-909

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 03,2008
  • Revised:May 19,2008
You are the first2044090Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063