Merkle Hash Trees and Trusted Timestamps: Tamper-Evidence for Monograph Versions and Minimal Proofs of Priority: chapter answers

Authors often compute one overall hash of a whole manuscript and assume that this both prevents tampering and proves priority. This book refutes two beliefs behind that habit: that one overall hash is enough to keep a manuscript in order, and that a hash plus a timestamp amounts to proof of copyright. Using Merkle trees, hash chains, anchoring and the birthday bound, it gives calculations that can be checked byte by byte. Its manuscripts, timestamps, salts and parameters are illustrative, and all calculations are generated by its programs. A hash and a timestamp show only that some content ex…

DOI pending · monograph page goes live after publication · 5DL-B-295 · 中文版

Illustrative model calculation, not a live quote