Skip to main navigation Skip to search Skip to main content

Improving disk sector integrity using k-dimension hashing

  • Zoe Jiang*
  • , Lucas Hui
  • , Siu Ming Yiu
  • *Corresponding author for this work
  • The University of Hong Kong

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

The integrity of data stored on a hard disk is typically verified by computing the chained hash value of disk sector data in a specific order. However, this technique fails when one or more sectors turn bad during storage, making it impossible to compute their hash values. This paper presents a k-dimension hashing scheme, which computes and stores multiple hash values for each hard disk sector. The hash values for each sector are computed in different ways; thus, when a hard disk develops bad sectors, it is still possible to verify the integrity of the data in the unaffected sectors. The paper also discusses how hashing parameters may be tuned to achieve desirable properties, including minimizing the probability that the integrity of a sector cannot be verified because other sectors have gone bad.

Original languageEnglish
Title of host publicationAdvances in Digital Forensics IV
EditorsPedro Cuenca, Carlos Guerrero, Ramon Puigjaner, Bartomeu Serra
Pages87-98
Number of pages12
DOIs
StatePublished - 2008
Externally publishedYes

Publication series

NameIFIP International Federation for Information Processing
Volume285
ISSN (Print)1571-5736

Keywords

  • Evidence integrity
  • Hard disks
  • Hash values
  • k-dimension hashing

Fingerprint

Dive into the research topics of 'Improving disk sector integrity using k-dimension hashing'. Together they form a unique fingerprint.

Cite this