Collision resistant hashing for paranoids: dealing with multiple collisions

DOI10.1007/978-3-319-78375-8_6MaRDI QIDQ1648826zbMATH OpenOpenAlexFDO

Authors Ilan Komargodski, Moni Naor, Eylon Yogev

Publication date 9 July 2018

Full work available at URL https://doi.org/10.1007/978-3-319-78375-8_6

zbMATH Keywords

collision resistant hash (CRH) function

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Multi-collision resistant hash functions and their applications
• Multi-collision resistance: a paradigm for keyless hash functions
• Theory of Cryptography
• On distributional collision resistant hashing
• Distributional collision resistance beyond one-way functions

Cited in

(31)

• Multi-collision resistant hash functions and their applications
• On distributional collision resistant hashing
• Quantum algorithm for the multicollision problem
• On the CCA compatibility of public-key infrastructure
• On subset-resilient hash function families
• Non-malleable codes for bounded parallel-time tampering
• On the complexity of collision resistant hash functions: new and old black-box separations
• Statistical difference beyond the polarizing regime
• Collisions for RC4-Hash
• Low-complexity cryptographic hash functions
• Multi-collision resistance: a paradigm for keyless hash functions
• Advances in Cryptology – CRYPTO 2004
• Theory of Cryptography
• Non-adaptive universal one-way hash functions from arbitrary one-way functions
• On time-space tradeoffs for bounded-length collisions in Merkle-Damgård hashing
• Collision-resistance from multi-collision-resistance
• The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
• Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols
• Collision Resistance from Multi-collision Resistance
• Constant-round arguments from one-way functions
• Quantum advantage from one-way functions
• Collision resistance from multi-collision resistance for all constant parameters
• Constant-round arguments for batch-verification and bounded-space computations from one-way functions
• Collisionful keyed hash functions with selectable collisions
• Time-space tradeoffs for finding multi-collisions in Merkle-Damgård hash functions
• Public-coin three-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
• Instance compression, revisited
• On the black-box complexity of correlation intractability
• Verifiable quantum advantage without structure
• On the instance optimality of detecting collisions and subgraphs

This page was built for publication: Collision resistant hashing for paranoids: dealing with multiple collisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1648826)