Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance

By Phillip Rogaway, Thomas Shrimpton. Fast Software Encryption Workshop, 2004

693 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Non-Fungible Token (NFT): Overview, Evaluation, Opportunities and Challenges (2021, background): “Assume that the blockchain is a robust public transaction ledger [85,86] and a hash algorithm is preimage resistance and second preimage resistance [104].”
HotStuff: BFT Consensus with Linearity and Responsiveness (2019, background): “The hash function must be collision resistant [46], which informally requires that the probability of an adversary producing inputsm andm′ such that h(m) = h(m′) is negligible.”
XMSS - A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions (2011, background): “Since target collision resistant hash function families are second preimage resistant (see [26]), this implies that second preimage resistant hash function families can be constructed from secure digital signature schemes.”
A Review on the Use of Blockchain for the Internet of Things (2018, background): “, they should not generate collisions [121]), fast and should consume the smallest possible amount of energy.”
Introduction to Modern Cryptography, Second Edition (2014, neutral): “Additional discussion regarding notions of security for hash functions besides collision resistance can be found in [120, 150].”