%0 Conference Proceedings
%T Using Approximate Matching to Reduce the Volume of Digital Data
%+ Hochschule Darmstadt
%+ Center for Advanced Security Research Darmstadt [Darmstadt] (CASED)
%+ Fraunhofer Institute for Secure Information Technology [Darmstadt] (Fraunhofer SIT)
%A Breitinger, Frank
%A Winter, Christian
%A Yannikos, York
%A Fink, Tobias
%A Seefried, Michael
%Z Part 2: Forensic Techniques
%< avec comité de lecture
%( IFIP Advances in Information and Communication Technology
%B 10th IFIP International Conference on Digital Forensics (DF)
%C Vienna, Austria
%Y Gilbert Peterson
%Y Sujeet Shenoi
%I Springer
%3 Advances in Digital Forensics X
%V AICT-433
%P 149-163
%8 2014-01-08
%D 2014
%R 10.1007/978-3-662-44952-3_11
%K File identification
%K approximate matching
%K ssdeep
%Z Computer Science [cs]Conference papers
%X Digital forensic investigators frequently have to search for relevant files in massive digital corpora – a task often compared to finding a needle in a haystack. To address this challenge, investigators typically apply cryptographic hash functions to identify known files. However, cryptographic hashing only allows the detection of files that exactly match the known file hash values or fingerprints. This paper demonstrates the benefits of using approximate matching to locate relevant files. The experiments described in this paper used three test images of Windows XP, Windows 7 and Ubuntu 12.04 systems to evaluate fingerprint-based comparisons. The results reveal that approximate matching can improve file identification – in one case, increasing the identification rate from 1.82% to 23.76%.
%G English
%Z TC 11
%Z WG 11.9
%2 https://inria.hal.science/hal-01393769/document
%2 https://inria.hal.science/hal-01393769/file/978-3-662-44952-3_11_Chapter.pdf
%L hal-01393769
%U https://inria.hal.science/hal-01393769
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-AICT
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-DF
%~ IFIP-WG11-9
%~ IFIP-AICT-433