Keying hash functions for message authentication

DMCA

Keying hash functions for message authentication (1996)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Mihir Bellare , Ran Canetti , Hugo Krawczyk

Citations:

610 - 39 self

BibTeX

@INPROCEEDINGS{Bellare96keyinghash,
    author = {Mihir Bellare and Ran Canetti and Hugo Krawczyk},
    title = {Keying hash functions for message authentication},
    booktitle = {},
    year = {1996},
    pages = {1--15},
    publisher = {Springer-Verlag}
}

OpenURL

Abstract

The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new constructions of message authentication schemes based on a cryptographic hash function. Our schemes, NMAC and HMAC, are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths. Moreover we show, in a quantitativeway, that the schemes retain almost all the security of the underlying hash function. In addition our schemes are e cient and practical. Their performance is essentially that of the underlying hash function. Moreover they use the hash function (or its compression function) as a black box, so that widely available library code or hardware can be used to implement them in a simple way, and replaceability of the underlying hash function is easily supported.

Keyphrases

hash function message authentication underlying hash function cryptographic hash function available library code simple way ad hoc technique message authentication scheme present new construction reasonable cryptographic strength compression function standard approach inmanyinternet application sound security analysis black box

DMCA