The DOI matches its Crossref record.
Keying Hash Functions for Message Authentication
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 19
- R. Atkinson, “Security Architecture for the Internet Protocol”, IETF Network Working Group, RFC 1825, August 1995. · DOI · Paper page
- R. Atkinson, “IP Authentication Header”, IETF Network Working Group, RFC 1826, August 1995. · DOI
- M. Bellare, R. Guérin and P. Rogaway, “XOR MACs: New methods for message authentication using finite pseudorandom functions,” Advances in Cryptology — Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995.
- M. Bellare, J. Kilian and P. Rogaway, “The security of cipher block chaining.” Advances in Cryptology — Crypto 94 Proceedings, Lecture Notes in Computer Science Vol. 839, Y. Desmedt ed., Springer-Verlag, 1994.
- A. Bosselaers, R. Govaerts, J. Vandewalle, “Fast hashing on the Pentium,” Advances in Cryptology — Crypto 96 Proceedings, Lecture Notes in Computer Science Vol. ??, N. Koblitz ed., Springer-Verlag, 1996.
- I. Damgård, “A design principle for hash functions,” Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989.
- H. Dobbertin, “MD4 is not collision-free,” Manuscript, September 1995. To appear in Fast Software Encryption Workshop, Cambridge, 1996.
- National Institute for Standards and Technology, “Digital Signature Standard (DSS)”, Federal Register, Vol. 56, No. 169, August, 1991
- O. Goldreich, S. Goldwasser and S. Micali, “How to construct random functions,” Journal of the ACM, Vol. 33, No. 4, 210–217, (1986). · DOI · Paper page
- B. Kaliski and M. Robshaw, “Message Authentication with MD5”, RSA Labs’ CryptoBytes, Vol. 1 No. 1, Springer 1995.
- P. Metzger and W. Simpson, “IP Authentication using Keyed MD5”, IETF Network Working Group, RFC 1828, August 1995. · DOI
- R. Merkle, “One way hash functions and DES,” Advances in Cryptology — Crypto 89 Proceedings, Lecture Notes in Computer Science Vol. 435, G. Brassard ed., Springer-Verlag, 1989. (Based on unpublished paper from 1979 and his Ph. D thesis, Stanford, 1979).
- J. Nechvatal, “Public Key Cryptography,” in Contemporary Cryptography, The Science of Information Integrity, G. Simmons ed., IEEE Press, 1992. · DOI
- B. Preneel and P. van Ooorschot, “MD-x MAC and building fast MACs from hash functions,” Advances in Cryptology — Crypto 95 Proceedings, Lecture Notes in Computer Science Vol. 963, D. Coppersmith ed., Springer-Verlag, 1995. · DOI
- B. Preneel and P. van Oorschot, “On the security of two MAC algorithms,” Advances in Cryptology — Eurocrypt 96 Proceedings, Lecture Notes in Computer Science Vol. 1070, U. Maurer ed., Springer-Verlag, 1996.
- R. Rivest, “The MD5 message-digest algorithm,” IETF Network Working Group, RFC 1321, April 1992. · DOI
- J. Touch, “Performance Analysis of MD5”, Proceedings of Sigcomm’ 95, pp. 77–86. (See also RFC 1810). · DOI
- G. Tsudik, “Message authentication with one-way hash functions,” Proceedings of Infocom 92.
- P. van Oorschot and M. Wiener, “Parallel Collision Search with Applications to Hash Functions and Discrete Logarithms”, Proceedings of the 2nd ACM Conf. Computer and Communications Security, Fairfax, VA, November 1994. · DOI
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Secure audit logs to support computer forensics
Schneier, B., & Kelsey, J. (1999) · ACM Transactions on Information and System Security · doi:10.1145/317087.317089 · Cited by 443
Robotics cyber security: vulnerabilities, attacks, countermeasures, and recommendations
Yaacoub, J.-P. A., Noura, H. N., Salman, O., & Chehab, A. (2022) · International Journal of Information Security · doi:10.1007/s10207-021-00545-8 · Cited by 320
“This maintains secure communication and ensures authentication, integrity, confidentiality, and availability [331].”
The Secure HyperText Transfer Protocol
Rescorla, E., & Schiffman, A. (1999) · doi:10.17487/rfc2660 · Cited by 138
Riffle: An Efficient Communication System With Strong Anonymity
Kwon, A., Lazar, D., Devadas, S., & Ford, B. (2016) · Proceedings on Privacy Enhancing Technologies · doi:10.1515/popets-2016-0008 · Cited by 84
Metadata
- Authors
- Bellare, M., Canetti, R., & Krawczyk, H.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1996
- Pages
- 1-15
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2131300413
- Cited by
- 1,580
- References
- 0
- FWCI
- 26.09
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Keying Hash Functions for Message Authentication. https://app.cochat.ai/papers/10.1007/3-540-68697-5_1
- The paper
- Bellare, M., Canetti, R., & Krawczyk, H. (1996). Keying Hash Functions for Message Authentication. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-68697-5_1
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
