Paper 2006/477
Dynamic Cryptographic Hash Functions
William R. Speirs II and Samuel S. Wagstaff Jr.
Abstract
We present the dynamic cryptographic hash function, a new type of hash function which takes two parameters instead of one. The additional parameter, the security parameter, specifies the internal workings and size of the digest produced. We provide a formal definitions for a dynamic cryptographic hash function and for the traditional security properties, modified for dynamic hash functions. Two additional properties, security parameter collision resistance and digest resistance, are also defined. The additional properties are motivated by scenarios where a dynamic hash functions more cleanly provides a solution to a typical cryptographic problem.
Note: Updates to the definitions.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- Hash functiondynamicpreimage resistancecollision resistance
- Contact author(s)
- bill speirs @ gmail com
- History
- 2007-05-21: last of 2 revisions
- 2006-12-24: received
- See all versions
- Short URL
- https://ia.cr/2006/477
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2006/477,
author = {William R. Speirs II and Samuel S. Wagstaff Jr.},
title = {Dynamic Cryptographic Hash Functions},
howpublished = {Cryptology ePrint Archive, Paper 2006/477},
year = {2006},
note = {\url{https://eprint.iacr.org/2006/477}},
url = {https://eprint.iacr.org/2006/477}
}
