File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Improving disk sector integrity using k-dimension hashing

TitleImproving disk sector integrity using k-dimension hashing
Authors
KeywordsEvidence integrity
Hard disks
Hash values
k-dimension hashing
Issue Date2008
PublisherSpringer Boston.
Citation
Ifip International Federation For Information Processing, 2008, v. 285, p. 87-98 How to Cite?
AbstractThe 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. © 2008 International Federation for Information Processing.
Persistent Identifierhttp://hdl.handle.net/10722/93427
ISSN
2012 SCImago Journal Rankings: 0.103
References

 

DC FieldValueLanguage
dc.contributor.authorJiang, Zen_HK
dc.contributor.authorHui, Len_HK
dc.contributor.authorYiu, SMen_HK
dc.date.accessioned2010-09-25T15:00:50Z-
dc.date.available2010-09-25T15:00:50Z-
dc.date.issued2008en_HK
dc.identifier.citationIfip International Federation For Information Processing, 2008, v. 285, p. 87-98en_HK
dc.identifier.issn1571-5736en_HK
dc.identifier.urihttp://hdl.handle.net/10722/93427-
dc.description.abstractThe 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. © 2008 International Federation for Information Processing.en_HK
dc.languageengen_HK
dc.publisherSpringer Boston.en_HK
dc.relation.ispartofIFIP International Federation for Information Processingen_HK
dc.subjectEvidence integrityen_HK
dc.subjectHard disksen_HK
dc.subjectHash valuesen_HK
dc.subjectk-dimension hashingen_HK
dc.titleImproving disk sector integrity using k-dimension hashingen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailHui, L:hui@cs.hku.hken_HK
dc.identifier.emailYiu, SM:smyiu@cs.hku.hken_HK
dc.identifier.authorityHui, L=rp00120en_HK
dc.identifier.authorityYiu, SM=rp00207en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/978-0-387-84927-0_8en_HK
dc.identifier.scopuseid_2-s2.0-51149104617en_HK
dc.identifier.hkuros152791en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-51149104617&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume285en_HK
dc.identifier.spage87en_HK
dc.identifier.epage98en_HK
dc.identifier.scopusauthoridJiang, Z=24344329800en_HK
dc.identifier.scopusauthoridHui, L=8905728300en_HK
dc.identifier.scopusauthoridYiu, SM=7003282240en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats