Using Approximate Matching to Reduce the Volume of Digital Data

back to overview


Breitinger, F., Winter, C., Yannikos, Y., Fink, T., & Seefried, M. (2014). Using Approximate Matching to Reduce the Volume of Digital Data. Paper presented at the Advances in Digital Forensics X.

Publication type

Paper in Conference Proceedings


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%.


Organizational Units

  • Institute of Information Systems
  • Hilti Chair for Data and Application Security