File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: An efficient scheme for hard disk integrity check in digital forensics by hashing with combinatorial group testing

TitleAn efficient scheme for hard disk integrity check in digital forensics by hashing with combinatorial group testing
Authors
KeywordsApplied Cryptography
Combinatorial Group Testing
Digital Forensics
Hard Disk Integrity
Issue Date2011
Citation
International Journal Of Digital Content Technology And Its Applications, 2011, v. 5 n. 2, p. 300-308 How to Cite?
AbstractIn this paper, we describe the problem of checking the integrity of a hard disk 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 changed (e.g. become bad sectors or deleted due to being part of the Legal Professional Privilege items). We propose an efficient hashing scheme with combinatorial group testing to calculate hash values for all sectors in a hard disk as the integrity proof and precisely locate the sectors which have been changed. Experimental results show that the scheme can significantly decrease the storage overhead (0.5MB needed for a 250GB hard disk) while require similar computational time compared to the existing approach. The computational time can be further decreased using our improved 2-stage approach.
Persistent Identifierhttp://hdl.handle.net/10722/152455
ISSN
2015 SCImago Journal Rankings: 0.118
References

 

DC FieldValueLanguage
dc.contributor.authorFang, Jen_US
dc.contributor.authorJiang, ZLen_US
dc.contributor.authorYiu, SMen_US
dc.contributor.authorHui, LCKen_US
dc.date.accessioned2012-06-26T06:39:15Z-
dc.date.available2012-06-26T06:39:15Z-
dc.date.issued2011en_US
dc.identifier.citationInternational Journal Of Digital Content Technology And Its Applications, 2011, v. 5 n. 2, p. 300-308en_US
dc.identifier.issn1975-9339en_US
dc.identifier.urihttp://hdl.handle.net/10722/152455-
dc.description.abstractIn this paper, we describe the problem of checking the integrity of a hard disk 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 changed (e.g. become bad sectors or deleted due to being part of the Legal Professional Privilege items). We propose an efficient hashing scheme with combinatorial group testing to calculate hash values for all sectors in a hard disk as the integrity proof and precisely locate the sectors which have been changed. Experimental results show that the scheme can significantly decrease the storage overhead (0.5MB needed for a 250GB hard disk) while require similar computational time compared to the existing approach. The computational time can be further decreased using our improved 2-stage approach.en_US
dc.languageengen_US
dc.relation.ispartofInternational Journal of Digital Content Technology and its Applicationsen_US
dc.subjectApplied Cryptographyen_US
dc.subjectCombinatorial Group Testingen_US
dc.subjectDigital Forensicsen_US
dc.subjectHard Disk Integrityen_US
dc.titleAn efficient scheme for hard disk integrity check in digital forensics by hashing with combinatorial group testingen_US
dc.typeArticleen_US
dc.identifier.emailYiu, SM:smyiu@cs.hku.hken_US
dc.identifier.emailHui, LCK:hui@cs.hku.hken_US
dc.identifier.authorityYiu, SM=rp00207en_US
dc.identifier.authorityHui, LCK=rp00120en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.4156/jdcta.vol5.issue2.35en_US
dc.identifier.scopuseid_2-s2.0-79952796673en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-79952796673&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume5en_US
dc.identifier.issue2en_US
dc.identifier.spage300en_US
dc.identifier.epage308en_US
dc.identifier.scopusauthoridFang, J=36132767400en_US
dc.identifier.scopusauthoridJiang, ZL=24344329800en_US
dc.identifier.scopusauthoridYiu, SM=7003282240en_US
dc.identifier.scopusauthoridHui, LCK=8905728300en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats