The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
UMAC: Fast and Secure Message Authentication
Open accessOverview
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
A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
Goldwasser, S., Micali, S., & Rivest, R. L. (1988) · SIAM Journal on Computing · doi:10.1137/0217017 · Cited by 2,804
Universal classes of hash functions
Carter, J. L., & Wegman, M. N. (1979) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(79)90044-8 · Cited by 2,519
HMAC: Keyed-Hashing for Message Authentication
Krawczyk, H., Bellare, M., & Canetti, R. (1997) · doi:10.17487/rfc2104 · Cited by 2,031
Self-citationKeying Hash Functions for Message Authentication
Bellare, M., Canetti, R., & Krawczyk, H. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_1 · Cited by 1,580
Self-citationNew hash functions and their use in authentication and set equality
Wegman, M. N., & Carter, J. L. (1981) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(81)90033-7 · Cited by 1,402
LFSR-based Hashing and Authentication
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_15 · Cited by 491
Self-citationThe 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-citationMDx-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
On Fast and Provably Secure Message Authentication Based on Universal Hashing
Shoup, V. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_24 · Cited by 211
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-citation
Cited by
Practical Byzantine fault tolerance
Castro, M., & Liskov, B. H. (1999) · Operating Systems Design and Implementation · doi:10.5555/296806.296824 · Cited by 3,205
Practical byzantine fault tolerance and proactive recovery
Castro, M., & Liskov, B. (2002) · ACM Transactions on Computer Systems · doi:10.1145/571637.571640 · Cited by 2,475
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Kent, S. T., & Strayer, W. T. (2001) · Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/383059.383060 · Cited by 733
Liskov, M., Rivest, R. L., & Wagner, D. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45708-9_3 · Cited by 468
Snoeren, A. C., Partridge, C., Sanchez, L. A., Jones, C. E., Tchakountio, F., Schwartz, B., Kent, S. T., & Strayer, W. T. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.804827 · Cited by 450
Metadata
- Authors
- Black, J., Halevi, S., Krawczyk, H., Krovetz, T., & Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1999
- Pages
- 216-233
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1578627459
- Cited by
- 390
- References
- 16
- FWCI
- 10.19
- Type
- conference paper
- Language
- en
- Open access
- bronze
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: UMAC: Fast and Secure Message Authentication. https://app.cochat.ai/papers/10.1007/3-540-48405-1_14
- The paper
- Black, J., Halevi, S., Krawczyk, H., Krovetz, T., & Rogaway, P. (1999). UMAC: Fast and Secure Message Authentication. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-48405-1_14
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.
