International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Long-lived digital integrity using short-lived hash functions

Authors:
Stuart Haber
Download:
URL: http://eprint.iacr.org/2007/238
Search ePrint
Search Google
Abstract: New collision-finding attacks on widely used cryptographic hash functions raise questions about systems that depend on certain properties of these functions for their security. Even after new and presumably better hash functions are deployed, users may have digital signatures and digital time-stamp certificates that were computed with recently deprecated hash functions. Is there any way to use a new and currently unassailable hash function to buttress the security of an old signature or time-stamp certificate? The main purpose of this note is to remind the technical community of a simple solution to this problem that was published more than a decade ago.
BibTeX
@misc{eprint-2007-13519,
  title={Long-lived digital integrity using short-lived hash functions},
  booktitle={IACR Eprint archive},
  keywords={implementation / hash functions, digital signatures},
  url={http://eprint.iacr.org/2007/238},
  note={Presented at NIST's Second Cryptographic Hash Workshop, August 2006. stuart.haber@acm.org 13679 received 15 Jun 2007},
  author={Stuart Haber},
  year=2007
}