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
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
Scalable and efficient provable data possession
Ateniese, G., Di Pietro, R., Mancini, L. V., & Tsudik, G. (2008) · Proceedings of the 4th international conference on Security and privacy in communication netowrks · doi:10.1145/1460877.1460889 · Cited by 1,129
Dynamic searchable symmetric encryption
Kamara, S., Papamanthou, C., & Roeder, T. (2012) · Proceedings of the 2012 ACM conference on Computer and communications security · doi:10.1145/2382196.2382298 · Cited by 1,111
Privacy Preserving Keyword Searches on Remote Encrypted Data
Chang, Y.-C., & Mitzenmacher, M. (2005) · Lecture Notes in Computer Science · doi:10.1007/11496137_30 · Cited by 1,041
Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2005) · Wireless Networks · doi:10.1007/s11276-004-4744-y · Cited by 1,033
Terra: a virtual machine-based platform for trusted computing
Garfinkel, T., Pfaff, B., Chow, J., Rosenblum, M., & Boneh, D. (2003) · ACM SIGOPS Operating Systems Review · doi:10.1145/1165389.945464 · Cited by 887
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-44448-3_41 · Cited by 879
Self-citationPassword-Based Authenticated Key Exchange in the Three-Party Setting
Abdalla, M., Fouque, P.-A., & Pointcheval, D. (2005) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-30580-4_6 · Cited by 833
SIA: secure information aggregation in sensor networks
Przydatek, B., Song, D., & Perrig, A. (2003) · Proceedings of the 1st international conference on Embedded networked sensor systems · doi:10.1145/958491.958521 · Cited by 789
Wormhole attacks in wireless networks
Hu, Y.-C., Perrig, A., & Johnson, D. B. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2005.861394 · Cited by 660
Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm
Bellare, M., & Namprempre, C. (2008) · Journal of Cryptology · doi:10.1007/s00145-008-9026-x · Cited by 652
Self-citationToward Secure and Dependable Storage Services in Cloud Computing
Wang, C., Wang, Q., Ren, K., Cao, N., & Lou, W. (2012) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2011.24 · Cited by 643
The Security of the Cipher Block Chaining Message Authentication Code
Bellare, M., Kilian, J., & Rogaway, P. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.1999.1694 · Cited by 596
Self-citationAn Efficient Protocol for Authenticated Key Agreement
Law, L., Menezes, A., Qu, M., Solinas, J., & Vanstone, S. (2003) · Designs, Codes and Cryptography · doi:10.1023/a:1022595222606 · Cited by 513
The Oracle Diffie-Hellman Assumptions and an Analysis of DHIES
Abdalla, M., Bellare, M., & Rogaway, P. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-45353-9_12 · Cited by 445
Self-citationSecure 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
Securing wireless sensor networks: a survey
Zhou, Y., Fang, Y., & Zhang, Y. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2008.4625802 · Cited by 424
Blockchain-Assisted Secure Device Authentication for Cross-Domain Industrial IoT
Shen, M., Liu, H., Zhu, L., Xu, K., Yu, H., Du, X., & Guizani, M. (2020) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2020.2980916 · Cited by 411
A Lightweight RFID Protocol to protect against Traceability and Cloning attacks
Dimitriou, T. (2006) · First International Conference on Security and Privacy for Emerging Areas in Communications Networks (SECURECOMM'05) · doi:10.1109/securecomm.2005.4 · Cited by 409
Cryptographic Extraction and Key Derivation: The HKDF Scheme
Krawczyk, H. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-14623-7_34 · Cited by 408
Self-citationIdentity-based key agreement protocols from pairings
Chen, L., Cheng, Z., & Smart, N. P. (2007) · International Journal of Information Security · doi:10.1007/s10207-006-0011-9 · Cited by 395
A survey of multimedia streaming in wireless sensor networks
Misra, S., Reisslein, M., & Xue, G. (2008) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2008.080404 · Cited by 392
UMAC: Fast and Secure Message Authentication
Black, J., Halevi, S., Krawczyk, H., Krovetz, T., & Rogaway, P. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1_14 · Cited by 390
Self-citationFault-scalable Byzantine fault-tolerant services
Abd-El-Malek, M., Ganger, G. R., Goodson, G. R., Reiter, M. K., & Wylie, J. J. (2005) · ACM SIGOPS Operating Systems Review · doi:10.1145/1095809.1095817 · Cited by 368
Towards realizing random oracles: Hash functions that hide all partial information
Canetti, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052255 · Cited by 365
Self-citationParanoid Android: versatile protection for smartphones
Portokalidis, G., Homburg, P., Anagnostakis, K., & Bos, H. (2010) · Proceedings of the 26th Annual Computer Security Applications Conference · doi:10.1145/1920261.1920313 · Cited by 350
Privacy-preserving record linkage using Bloom filters
Schnell, R., Bachteler, T., & Reiher, J. (2009) · BMC Medical Informatics and Decision Making · doi:10.1186/1472-6947-9-41 · Cited by 342
Efficient and provably secure aggregation of encrypted data in wireless sensor networks
Castelluccia, C., Chan, A. C.-F., Mykletun, E., & Tsudik, G. (2009) · ACM Transactions on Sensor Networks · doi:10.1145/1525856.1525858 · Cited by 331
A cost-effective, high-bandwidth storage architecture
Gibson, G. A., Nagle, D. F., Amiri, K., Butler, J., Chang, F. W., Gobioff, H., Hardin, C., Riedel, E., Rochberg, D., & Zelenka, J. (1998) · ACM SIGPLAN Notices · doi:10.1145/291006.291029 · Cited by 324
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].”
XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
Buchmann, J., Dahmen, E., & Hülsing, A. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25405-5_8 · Cited by 312
Achieving Efficient Conjunctive Keyword Searches over Encrypted Data
Ballard, L., Kamara, S., & Monrose, F. (2005) · Lecture Notes in Computer Science · doi:10.1007/11602897_35 · Cited by 299
Forward-Security in Private-Key Cryptography
Bellare, M., & Yee, B. (2003) · Lecture Notes in Computer Science · doi:10.1007/3-540-36563-x_1 · Cited by 275
Self-citationInternet Engineering Task Force
(2018) · The SAGE Encyclopedia of the Internet · doi:10.4135/9781473960367.n143 · Cited by 266
Modern Cryptography, Probabilistic Proofs and Pseudorandomness
Goldreich, O. (1999) · Algorithms and Combinatorics · doi:10.1007/978-3-662-12521-2 · Cited by 265
Abstracting application-level web security
Scott, D., & Sharp, R. (2002) · Proceedings of the 11th international conference on World Wide Web · doi:10.1145/511446.511498 · Cited by 257
Random key-assignment for secure Wireless Sensor Networks
Di Pietro, R., Mancini, L. V., & Mei, A. (2003) · Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks · doi:10.1145/986858.986868 · Cited by 257
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
Provable Security Analysis of FIDO2
Barbosa, M., Boldyreva, A., Chen, S., & Warinschi, B. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-84252-9_5 · Cited by 42
Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure
Pulls, T., & Peeters, R. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-24177-7_31 · Cited by 30
Secure data processing for IoT middleware systems
Ayoade, G., El-Ghamry, A., Karande, V., Khan, L., Alrahmawy, M., & Rashad, M. Z. (2019) · The Journal of Supercomputing · doi:10.1007/s11227-018-2686-x · Cited by 26
“The modules use the key hashing message authentication code (HMAC) [8], by using the key stored in the enclave to calculate the hash of a message before storing to disk.”
MethodInfluentialProtecting Key Exchange and Management Protocols Against Resource Clogging Attacks
Oppliger, R. (1999) · Secure Information Networks · doi:10.1007/978-0-387-35568-9_11 · Cited by 22
Countering Statistical Attacks in Cloud-Based Searchable Encryption
Ahsan, M. A. M., Ali, I., Bin Idris, M. Y. I., Imran, M., & Shoaib, M. (2020) · International Journal of Parallel Programming · doi:10.1007/s10766-018-0584-8 · Cited by 9
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.