Keying Hash Functions for Message Authentication
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
Security Architecture for the Internet Protocol
Atkinson, R. (1995) · doi:10.17487/rfc1825 · Cited by 2,762
How to construct random functions
Goldreich, O., Goldwasser, S., & Micali, S. (1986) · Journal of the ACM · doi:10.1145/6490.6503 · Cited by 2,115
The MD5 Message-Digest Algorithm
Rivest, R. (1992) · doi:10.17487/rfc1321 · Cited by 1,976
A Design Principle for Hash Functions
Damgård, I. B. (2007) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_39 · Cited by 1,188
One Way Hash Functions and DES
Merkle, R. C. (1990) · Lecture Notes in Computer Science · doi:10.1007/0-387-34805-0_40 · Cited by 872
Kent, S. (2005) · doi:10.17487/rfc4302 · Cited by 780
The Security of Cipher Block Chaining
Bellare, M., Kilian, J., & Rogaway, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_32 · Cited by 394
Self-citationXOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
Bellare, M., Guérin, R., & Rogaway, P. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_2 · Cited by 255
Self-citationAdvances in cryptology -- CRYPTO '86 : proceedings
Odlyzko, A. M. (1987) · Springer eBooks · Cited by 236
MDx-MAC and Building Fast MACs from Hash Functions
Preneel, B., & van Oorschot, P. C. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-44750-4_1 · Cited by 213
Pseudorandom functions revisited: the cascade construction and its concrete security
Bellare, M., Canetti, R., & Krawczyk, H. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548510 · Cited by 208
Self-citationDobbertin, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-60865-6_43 · Cited by 183
Advances in Cryptology — CRYPTO ’85 Proceedings
(1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x · Cited by 158
Parallel collision search with application to hash functions and discrete logarithms
van Oorschot, P. C., & Wiener, M. J. (1994) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/191177.191231 · Cited by 146
Advances in Cryptology — CRYPTO’ 89 Proceedings
(1990) · Lecture notes in computer science · doi:10.1007/0-387-34805-0 · Cited by 131
(1995) · Lecture notes in computer science · doi:10.1007/3-540-60590-8 · Cited by 110
Message authentication with one-way hash functions
Tsudik, G. (1992) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.1992.263477 · Cited by 100
On the Security of Two MAC Algorithms
Preneel, B., & van Oorschot, P. C. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68339-9_3 · Cited by 91
Touch, J. D. (1995) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/217382.217414 · Cited by 70
Nechvatal, J. (1991) · doi:10.6028/nist.sp.800-2 · Cited by 37
Research works printed but not linked: 4
- 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
- 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:10.17487/rfc1828
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Packet leashes: a defense against wormhole attacks in wireless networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2004) · IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428) · doi:10.1109/infcom.2003.1209219 · Cited by 1,513
Ariadne: a secure on-demand routing protocol for ad hoc networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002) · Proceedings of the 8th annual international conference on Mobile computing and networking · doi:10.1145/570645.570648 · Cited by 1,298
Zheng, Y. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052234 · Cited by 1,250
FPGA Intrinsic PUFs and Their Use for IP Protection
Guajardo, J., Kumar, S. S., Schrijen, G.-J., & Tuyls, P. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-74735-2_5 · Cited by 1,203
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
- 21
- 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
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.