2006 USENIX Annual Technical Conference Abstract
Pp. 8590 of the Proceedings
Compare-by-Hash: A Reasoned Analysis
J. Black, University of Colorado, Boulder
Compare-by-hash is the now-common practice used by systems designers
who assume that when the digest of a cryptographic hash function is
equal on two distinct files, then those files are identical. This
approach has been used in both real projects and in research efforts
(for example rysnc  and LBFS ).
A recent paper by Henson criticized this practice .
The present paper revisits the topic from an advocate's standpoint:
we claim that compare-by-hash is completely reasonable, and we
offer various arguments in support of this viewpoint in addition to
addressing concerns raised by Henson.
- View the full text of this paper in HTML and PDF. Listen to the presentation in MP3 format.
Until June 2007, you will need your USENIX membership identification in order to access the full papers. The Proceedings are published as a collective work, © 2006 by the USENIX Association. All Rights Reserved. Rights to individual papers remain with the author or the author's employer. Permission is granted for the noncommercial reproduction of the complete work for educational or research purposes. USENIX acknowledges all trademarks within this paper.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.