The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression 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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
(1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-48405-1 · Cited by 2,619
(2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45473-x · Cited by 1,422
Kiayias, A., Tsiounis, Y., & Yung, M. M. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-24676-3_34 · Cited by 1,267
(2005) · Lecture notes in computer science · doi:10.1007/b136415 · Cited by 1,234
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
(2019) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-26951-7 · Cited by 753
Urn models and their application
Johnson, N. L. (1977) · Cited by 682
Advances in Cryptology – EUROCRYPT 2008
Tillich, J., & Zémor, G. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-78967-3 · Cited by 521
Cited by
Multiparty Computation from Somewhat Homomorphic Encryption
Damgård, I., Pastro, V., Smart, N., & Zakarias, S. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-32009-5_38 · Cited by 1,331
Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
Brakerski, Z., & Vaikuntanathan, V. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-22792-9_29 · Cited by 1,096
Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
Applebaum, B., Cash, D., Peikert, C., & Sahai, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-03356-8_35 · Cited by 562
Pushing the Limits: A Very Compact and a Threshold Implementation of AES
Moradi, A., Poschmann, A., Ling, S., Paar, C., & Wang, H. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-20465-4_6 · Cited by 463
A Leakage-Resilient Mode of Operation
Pietrzak, K. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-01001-9_27 · Cited by 261
Metadata
- Authors
- Stam, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2008-08-20
- Pages
- 397-412
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2147436724
- Cited by
- 361
- References
- 24
- FWCI
- 43.17
- Type
- conference paper
- Language
- en
- Open access
- green
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: Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions. https://app.cochat.ai/papers/10.1007/978-3-540-85174-5_22
- The paper
- Stam, M. (2008). Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-540-85174-5_22
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.