Other Directory Sites: SeekWonder | Directory Owners Forum
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:16:03 ADT
Raph Levien (raph@acm.org)
Tue, 17 Mar 1998 14:59:07 -0800
CodherPlunks,
My thesis work is bringing me to look much more closely at
cryptographic hash functions and various techniques of stitching them
together. I'm looking for references that address these specific
questions:
* What's the best accessible reference that discusses the security
properties required of a good hash (i.e. collision resistance, first and
second preimage, maybe more exotic stuff regarding distance metrics)? I
seem to recall reading a paper that had this stuff as part of the HMAC
discussion a couple of years ago, but haven't been able to find it by
Web searching.
* More and more protocols are using hash chains (eg Schneier's
tamperproof logs) and hash trees (eg Surety's trusted timestamping
service). I'm looking towards generalizing these constructions towards
hash networks so that I can gain some fault tolerance properties, which
in turn will help guard against denial of service attacks. I know
Schneier hints at this possibility in his tamperproof logs paper, but I
wouldn't be surprised if someone has developed it further. Even if so,
I'd still appreciate good references for the basic hash chain and hash
tree constructions.
Any help would be greatly appreciated.
Thanks,
Raph
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:16:03 ADT