Multi-collision resistant hash functions and their applications

DOI10.1007/978-3-319-78375-8_5MaRDI QIDQ1648825zbMATH OpenOpenAlexFDO

Authors Itay Berman, Akshay Degwekar, Ron D. Rothblum, Prashant Nalini Vasudevan

Publication date 9 July 2018

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

zbMATH Keywords

multi-collision resistant hash functions (MCRH)

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Collision resistant hashing for paranoids: dealing with multiple collisions
• On distributional collision resistant hashing
• Distributional collision resistance beyond one-way functions
• Theory of Cryptography
• Multi-collision resistance: a paradigm for keyless hash functions

Cited in

(25)

• Collision resistant hashing for paranoids: dealing with multiple collisions
• 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
• scientific article; zbMATH DE number 4057439 (Why is no real title available?)
• Multi-collision resistance: a paradigm for keyless hash functions
• Advances in Cryptology – CRYPTO 2004
• How to Build a Hash Function from Any Collision-Resistant Function
• 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
• Efficient leakage-resilient MACs without idealized assumptions
• Collision Resistance from Multi-collision Resistance
• Quantum advantage from one-way functions
• Collision resistance from multi-collision resistance for all constant parameters
• 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
• On quantum query complexities of collision-finding in non-uniform random functions

This page was built for publication: Multi-collision resistant hash functions and their applications

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