Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot the international journal of robotics research and application · doi:10.1108/ir.1999.04926fae.001 · Cited by 39,228 · see citing works
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357 · see citing works
Handbook of Applied Cryptography
Menezes, A., van Oorschot, P. C., & Vanstone, S. A. (2010) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,910 · see citing works
Goldwasser, S., & Micali, S. M. (1984) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(84)90070-9 · Cited by 2,667 · see citing works
A Design Principle for Hash Functions
Damgård, I. (2007) · Springer eBooks · doi:10.1007/0-387-34805-0_39 · Cited by 1,192 · see citing works
Universal one-way hash functions and their cryptographic applications
Naor, M., & Yung, M. M. (1989) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/73007.73011 · Cited by 960 · see citing works
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 880 · see citing works
Relations among notions of security for public-key encryption schemes
Bellare, M., Desai, A., Pointcheval, D., et al. (1998) · Lecture notes in computer science · doi:10.1007/bfb0055718 · Cited by 811 · see citing works
Collision Free Hash Functions and Public Key Signature Schemes
Damgård, I. (2010) · Lecture notes in computer science · doi:10.1007/3-540-39118-5_19 · Cited by 339 · see citing works
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
Black, J., Rogaway, P., & Shrimpton, T. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45708-9_21 · Cited by 337 · see citing works
Self-citationSchneier, B. (2015) · doi:10.1002/9781119183471.ch18 · Cited by 238 · see citing works
Collision-Resistant hashing: Towards making UOWHFs practical
Mihir Bellare, Y., & Rogaway, P. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052256 · Cited by 216 · see citing works
Self-citationPreneel, B. (1994) · European Transactions on Telecommunications · doi:10.1002/ett.4460050406 · Cited by 140 · see citing works
Gligoroski, D. (2011) · Chapman & Hall/CRC eBooks · doi:10.1201/b11467-9 · Cited by 90 · see citing works
Hash Functions: From Merkle-Damgård to Shoup
Mironov, I. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44987-6_11 · Cited by 42 · see citing works
Formal Security Proofs for a Signature Scheme with Partial Message Recovery
Brown, D. R. L., & Johnson, D. B. (2001) · Lecture notes in computer science · doi:10.1007/3-540-45353-9_11 · Cited by 20 · see citing works
Some observations on the theory of cryptographic hash functions.
Stinson, D. R. (2001) · Cited by 12 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A Review on the Use of Blockchain for the Internet of Things
Fernandez-Carames, T. M., & Fraga-Lamas, P. (2018) · IEEE Access · doi:10.1109/access.2018.2842685 · Cited by 1,078 · see citing works
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 · see citing works
- Authors
- Rogaway, P., & Shrimpton, T.
- Affiliations
- Chiang Mai University (TH)
- University of California, Davis (US)
- ORCID
- Shrimpton, Thomas
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 371-388
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2155690458
- Cited by
- 614
- References
- 17
- Citations by year
- 2026: 15 · 2025: 37 · 2024: 39 · 2023: 28 · 2022: 55 · 2021: 37 · 2020: 27 · 2019: 46 · 2018: 42 · 2017: 22 · 2016: 16 · 2015: 22 · 2014: 15 · 2013: 23 · 2012: 32
- FWCI
- 12.54
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Computer Science › Artificial Intelligence › Coding theory and cryptography
- Keywords
- cryptographic hash functions, preimage resistance, second preimage resistance, collision resistance, security definitions, security implications, concrete security, provable security, counterexample
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
