A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost

Mihir Bellare; Daniele Micciancio

Paper 1997/001

A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost

Mihir Bellare and Daniele Micciancio

Abstract

We present a simple, new paradigm for the design of collision-free hash functions. Any function emanating from this paradigm is <i>incremental.</i> (This means that if a message x which I have previously hashed is modified to x' then rather than having to re-compute the hash of x' from scratch, I can quickly ``update'' the old hash value to the new one, in time proportional to the amount of modification made in x to get x'.) Also any function emanating from this paradigm is parallelizable, useful for hardware implementation.

Metadata

Available format(s): PS
Publication info: Published elsewhere. Appeared in the THEORY OF CRYPTOGRAPHY LIBRARY and has been included in the ePrint Archive.
Keywords: Incremental cryptography hash functions collision-resistance discrete logarithms.
Contact author(s): mihir @ cs ucsd edu
History: 1997-02-26: received
Short URL: https://ia.cr/1997/001
License: CC BY

BibTeX

@misc{cryptoeprint:1997/001,
      author = {Mihir Bellare and Daniele Micciancio},
      title = {A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost},
      howpublished = {Cryptology {ePrint} Archive, Paper 1997/001},
      year = {1997},
      url = {https://eprint.iacr.org/1997/001}
}