Skip to Main content Skip to Navigation
Conference papers

Similarity Hashing Based on Levenshtein Distances

Abstract : It is increasingly common in forensic investigations to use automated pre-processing techniques to reduce the massive volumes of data that are encountered. This is typically accomplished by comparing fingerprints (typically cryptographic hashes) of files against existing databases. In addition to finding exact matches of cryptographic hashes, it is necessary to find approximate matches corresponding to similar files, such as different versions of a given file.This paper presents a new stand-alone similarity hashing approach called saHash, which has a modular design and operates in linear time. saHash is almost as fast as SHA-1 and more efficient than other approaches for approximate matching. The similarity hashing algorithm uses four sub-hash functions, each producing its own hash value. The four sub-hashes are concatenated to produce the final hash value. This modularity enables sub-hash functions to be added or removed, e.g., if an exploit for a sub-hash function is discovered. Given the hash values of two byte sequences, saHash returns a lower bound on the number of Levenshtein operations between the two byte sequences as their similarity score. The robustness of saHash is verified by comparing it with other approximate matching approaches such as +sdhash+.
Document type :
Conference papers
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Tuesday, November 8, 2016 - 10:48:06 AM
Last modification on : Thursday, March 5, 2020 - 4:46:28 PM
Long-term archiving on: : Tuesday, March 14, 2017 - 11:33:50 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Frank Breitinger, Georg Ziroff, Steffen Lange, Harald Baier. Similarity Hashing Based on Levenshtein Distances. 10th IFIP International Conference on Digital Forensics (DF), Jan 2014, Vienna, Austria. pp.133-147, ⟨10.1007/978-3-662-44952-3_10⟩. ⟨hal-01393767⟩



Record views


Files downloads