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
Bruce Schneier (schneier@visi.com)
Tue, 17 Mar 1998 19:26:55 -0600 (CST)
> 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.
There's not all that much recent. Start with my book, move to The
Handbook of Applied Cryptography, then try to get Bart Preneel's PhD
thesis (which I believe has been updated).
> * 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.
We've done more work, but the USENIX paper is the only reference. Call
me if you want to talk about ideas.
Bruce
The following archive was created by hippie-mail 7.98617-22 on Fri Aug 21 1998 - 17:16:03 ADT