Bytewise Approximate Matching: The Good, The Bad, and The Unknown

• Published in: The journal of digital forensics, security and law Vol. 11; no. 2; p. 59
• Main Authors: Harichandran, Vikram, Breitinger, Frank, Baggili, Ibrahim
• Format: Journal Article
• Language: English
• Published: Farmville Association of Digital Forensics, Security and Law 01.01.2016
• Subjects: Algorithms; Automation; Computer forensics; Criminal investigations; Forensic sciences; Plagiarism; Researchers; Semantics
• ISSN: 1558-7223; 1558-7215; 1558-7223
• DOI: 10.15394/jdfsl.2016.1379

Hash functions are established and well-known in digital forensics, where they are commonly used for proving integrity and file identification (i.e., hash all files on a seized device and compare the fingerprints against a reference database). However, with respect to the latter operation, an active adversary can easily overcome this approach because traditional hashes are designed to be sensitive to altering an input; output will significantly change if a single bit is flipped. Therefore, researchers developed approximate matching, which is a rather new, less prominent area but was conceived as a more robust counterpart to traditional hashing. Since the conception of approximate matching, the community has constructed numerous algorithms, extensions, and additional applications for this technology, and are still working on novel concepts to improve the status quo. In this survey article, we conduct a high-level review of the existing literature from a non-technical perspective and summarize the existing body of knowledge in approximate matching, with special focus on bytewise algorithms. Our contribution allows researchers and practitioners to receive an overview of the state of the art of approximate matching so that they may understand the capabilities and challenges of the field. Simply, we present the terminology, use cases, classification, requirements, testing methods, algorithms, applications, and a list of primary and secondary literature.