The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Universal hashing and authentication codes
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
The design of optimum multifactorial experiments
PLACKETT, R. L., & BURMAN, J. P. (1946) · Biometrika · doi:10.1093/biomet/33.4.305 · Cited by 3,906
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
New 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
A survey of information authentication
Simmons, G. J. (1988) · Proceedings of the IEEE · doi:10.1109/5.4445 · Cited by 241
On Families of Hash Functions via Geometric Codes and Concatenation
Bierbrauer, J., Johansson, T., Kabatianskii, G. A., & Smeets, B. (2007) · Springer eBooks · doi:10.1007/3-540-48329-2_28 · Cited by 138
The combinatorics of authentication and secrecy codes
Stinson, D. R. (1990) · Journal of Cryptology · doi:10.1007/bf02252868 · Cited by 125
Self-citationPartial λ-Geometries and Generalized Hadamard Matrices Over Groups
Drake, D. A. (1979) · Canadian Journal of Mathematics · doi:10.4153/cjm-1979-062-1 · Cited by 95
Some Constructions and Bounds for Authentication Codes
Stinson, D. R. (2007) · Springer eBooks · doi:10.1007/3-540-47721-7_30 · Cited by 71
Self-citationSome constructions and bounds for authentication codes
Stinson, D. R. (1988) · Journal of Cryptology · doi:10.1007/bf00206324 · Cited by 63
Self-citation
Cited by
Chosen-Ciphertext Security from Identity-Based Encryption
Canetti, R., Halevi, S., & Katz, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24676-3_13 · Cited by 900
LFSR-based Hashing and Authentication
Krawczyk, H. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48658-5_15 · Cited by 491
A generator for unique quantum random numbers based on vacuum states
Gabriel, C., Wittmann, C., Sych, D., Dong, R., Mauerer, W., Andersen, U. L., Marquardt, C., & Leuchs, G. (2010) · Nature Photonics · doi:10.1038/nphoton.2010.197 · Cited by 419
Chosen‐Ciphertext Security from Identity‐Based Encryption
Boneh, D., Canetti, R., Halevi, S., & Katz, J. (2007) · SIAM Journal on Computing · doi:10.1137/s009753970544713x · Cited by 415
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
Gehring, T., Händchen, V., Duhme, J., Furrer, F., Franz, T., Pacher, C., Werner, R. F., & Schnabel, R. (2015) · Nature Communications · doi:10.1038/ncomms9795 · Cited by 291
On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited
Naor, M., & Reingold, O. (1999) · Journal of Cryptology · doi:10.1007/pl00003817 · Cited by 285
Gope, P., & Hwang, T. (2016) · IEEE Transactions on Industrial Electronics · doi:10.1109/tie.2016.2585081 · Cited by 267
A modular framework for randomness extraction based on Trevisan's construction
Mauerer, W., Portmann, C., & Scholz, V. B. (2012) · arXiv · doi:10.48550/arxiv.1212.0520 · Cited by 23
Metadata
- Authors
- Stinson, D. R.
- Venue
- Designs, Codes and Cryptography
- Published
- 1994-07
- Volume
- 4
- Issue
- 3
- Pages
- 369-380
- ISSN
- 0925-1022 (ISSN-L)
- 1573-7586
- OpenAlex
- W1981670729
- Cited by
- 292
- References
- 9
- FWCI
- 8.15
- Type
- journal article
- 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.