Jump to content

Fuzzy hashing

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Citation bot (talk | contribs) at 02:29, 6 July 2022 (Alter: pages. Add: year, authors 1-1. Removed parameters. Formatted dashes. Some additions/deletions were parameter name changes. | Use this bot. Report bugs. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 278/283). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Fuzzy hashing, also known as similarity hashing[1], is a technique for detecting data that is similar, but not exactly the same, as other data. This is in contrast to Cryptographic hash functions, which are designed to have significantly different hashes for even minor differences. Fuzzy hashing has been used to identify malware and has potential for other applications, like data loss prevention [2].

Background

A hash function is a mathematical algorithm which maps arbitrary-sized data to a fixed size output[3]. Many solutions use cryptographic hash functions like SHA-256 to detect duplicates or check for known files within large collection of files[4]. However, cryptographic hash functions cannot be used for determining if a file is similar to a known file, because one of the requirements of a cryptographic hash function is that a small change to the input should change the hash value so extensively that the new hash value appears uncorrelated with the old hash value (avalanche effect)[5].

Fuzzy hashing exists to solve this problem of detecting data that is similar, but not exactly the same, as other data. Fuzzy hashing algorithms specifically use algorithms in which two similar inputs will generate two similar hash values. This property is the exact opposite of the avalanche effect desired in cryptographic hash functions.

Concept of Operation

Reread:

Applications

Fuzzy Hashing has applications for the following scenarios:

Notable tools

See also

References

  1. ^ "NIST Special Publication 800-168" (PDF). NIST.gov. Retrieved June 30, 2022.
  2. ^ Kornblum, Jesse (2006). "Identifying almost identical files using context triggered piecewise hashing". Digital Investigation. 3, Supplement (September 2006): 91–97. doi:10.1016/j.diin.2006.06.015. Retrieved June 30, 2022.
  3. ^ Schueffel, Patrick; Groeneweg, Nikolaj; Baldegger, Rico (2019). The Crypto Encyclopdia - Coins, tokens and digital assets from A to Z. Bern, Fribourg: Growth Publisher / HEG Fribourg. p. 27. ISBN 978-2-940384-47-1.
  4. ^ Kornblum, Jesse (2006). "Identifying almost identical files using context triggered piecewise hashing". Digital Investigation. 3, Supplement (September 2006): 91–97. doi:10.1016/j.diin.2006.06.015. Retrieved June 30, 2022.
  5. ^ Al-Kuwari, Saif; Davenport, James H.; Bradford, Russell J. (2011). "Cryptographic Hash Functions: Recent Design Trends and Security Notions". Cryptology ePrint Archive. Report 2011/565.

Jonathan Oliver; et al. (2021). "Designing the Elements of a Fuzzy Hashing Scheme" (PDF). Archived (PDF) from the original on 14 April 2021. Retrieved 14 April 2021.

http://www.csroc.org.tw/journal/JOC30_2/JOC3002-13.pdf