The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
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
The MD5 Message-Digest Algorithm
Rivest (1992) · Medical Entomology and Zoology · Cited by 2,853
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
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
How to Construct Pseudorandom Permutations from Pseudorandom Functions
Luby, M., & Rackoff, C. (1988) · SIAM Journal on Computing · doi:10.1137/0217022 · Cited by 938
A fast and simple randomized parallel algorithm for the maximal independent set problem
Alon, N., Babai, L., & Itai, A. (1986) · Journal of Algorithms · doi:10.1016/0196-6774(86)90019-2 · Cited by 823
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-citationIncremental Cryptography: The Case of Hashing and Signing
Bellare, M., Goldreich, O., & Goldwasser, S. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_22 · Cited by 312
Self-citationAdvances in Cryptology — CRYPTO ’85 Proceedings
(1986) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x · Cited by 158
Incremental cryptography and application to virus protection
Bellare, M., Goldreich, O., & Goldwasser, S. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225080 · Cited by 132
Self-citation
Cited by
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Keying 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-citationA concrete security treatment of symmetric encryption
Bellare, M., Desai, A., Jokipii, E., & Rogaway, P. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646128 · Cited by 931
Self-citationZhu, S., Setia, S., Jajodia, S., & Ning, P. (2004) · IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004 · doi:10.1109/secpri.2004.1301328 · Cited by 556
OCB: a block-cipher mode of operation for efficient authenticated encryption
Rogaway, P., Bellare, M., Black, J., & Krovetz, T. (2001) · Proceedings of the 8th ACM conference on Computer and Communications Security · doi:10.1145/501983.502011 · Cited by 368
Self-citation
Metadata
- Authors
- Bellare, M., Guérin, R., & Rogaway, P.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1995
- Pages
- 15-28
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W2167569963
- Cited by
- 255
- References
- 11
- FWCI
- 9.28
- 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: XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions. https://app.cochat.ai/papers/10.1007/3-540-44750-4_2
- The paper
- Bellare, M., Guérin, R., & Rogaway, P. (1995). XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-44750-4_2
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.