File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Hard disk integrity check by hashing with combinatorial group testing

TitleHard disk integrity check by hashing with combinatorial group testing
Authors
KeywordsCombinatorial group testing
Execution time
Hash value
Integrity check
Computer science
Issue Date2009
PublisherIEEE.
Citation
The 2009 International Workshop on Forensics for Future Generation Communication Environments (F2GC-09) in conjunction with CSA 2009, Jeju Island, Korea, 10-12 December 2009. In Proceedings of CSA, 2009, p. 1-6 How to Cite?
AbstractIn this paper, we describe the problem of verifying the integrity of a hard disk especially for forensics investigation after the computer of a suspect has been seized. Existing solutions do not provide a satisfactory solution to solve the problem. They either require a huge amount of storage to store the hash values of the sectors or may not be able to cope with the situation in an effective way in case some sectors have been modified (e.g. become bad sectors or deleted due to being part of the Legal Professional Privilege items). We introduce to use Thierry-Mieg[15]'s combinatorial group testing scheme, which seems to be an unrelated topic, to design a scheme to compute the hash values for the sectors of a hard disk. The storage for hash values in our scheme can be significantly fewer than the best existing solution while requiring similar amount of execution time. And our scheme can accurately point out the sectors which have been modified while existing solutions cannot guarantee this. © 2009 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/125711
ISBN
References

 

DC FieldValueLanguage
dc.contributor.authorFang, Jen_HK
dc.contributor.authorJiang, ZLen_HK
dc.contributor.authorYiu, SMen_HK
dc.contributor.authorHui, LCKen_HK
dc.date.accessioned2010-10-31T11:47:27Z-
dc.date.available2010-10-31T11:47:27Z-
dc.date.issued2009en_HK
dc.identifier.citationThe 2009 International Workshop on Forensics for Future Generation Communication Environments (F2GC-09) in conjunction with CSA 2009, Jeju Island, Korea, 10-12 December 2009. In Proceedings of CSA, 2009, p. 1-6en_HK
dc.identifier.isbn978-1-4244-4946-0-
dc.identifier.urihttp://hdl.handle.net/10722/125711-
dc.description.abstractIn this paper, we describe the problem of verifying the integrity of a hard disk especially for forensics investigation after the computer of a suspect has been seized. Existing solutions do not provide a satisfactory solution to solve the problem. They either require a huge amount of storage to store the hash values of the sectors or may not be able to cope with the situation in an effective way in case some sectors have been modified (e.g. become bad sectors or deleted due to being part of the Legal Professional Privilege items). We introduce to use Thierry-Mieg[15]'s combinatorial group testing scheme, which seems to be an unrelated topic, to design a scheme to compute the hash values for the sectors of a hard disk. The storage for hash values in our scheme can be significantly fewer than the best existing solution while requiring similar amount of execution time. And our scheme can accurately point out the sectors which have been modified while existing solutions cannot guarantee this. © 2009 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE.-
dc.relation.ispartofProceedings of the International Conference on Computer Science and Its Applications, CSA 2009en_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rightsProceedings of the International Conference on Computer Science and Its Applications. Copyright © IEEE.-
dc.rights©2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.subjectCombinatorial group testing-
dc.subjectExecution time-
dc.subjectHash value-
dc.subjectIntegrity check-
dc.subjectComputer science-
dc.titleHard disk integrity check by hashing with combinatorial group testingen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailYiu, SM:smyiu@cs.hku.hken_HK
dc.identifier.emailHui, LCK:hui@cs.hku.hken_HK
dc.identifier.authorityYiu, SM=rp00207en_HK
dc.identifier.authorityHui, LCK=rp00120en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/CSA.2009.5404206en_HK
dc.identifier.scopuseid_2-s2.0-80655124326en_HK
dc.identifier.hkuros182441en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80655124326&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage6-
dc.description.otherThe 2009 International Workshop on Forensics for Future Generation Communication Environments (F2GC-09) in conjunction with CSA 2009, Jeju Island, Korea, 10-12 December 2009. In Proceedings of CSA, 2009, p. 1-6-
dc.identifier.scopusauthoridFang, J=36132767400en_HK
dc.identifier.scopusauthoridJiang, ZL=24344329800en_HK
dc.identifier.scopusauthoridYiu, SM=7003282240en_HK
dc.identifier.scopusauthoridHui, LCK=8905728300en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats