Collapseability of tree hashes
From MaRDI portal
Recommendations
- Classical proofs for the quantum collapsing property of classical hash functions
- Post-quantum security of the sponge construction
- Quantum security of hash functions and property-preservation of iterated hashing
- Compactness of hashing modes and efficiency beyond Merkle tree
- scientific article; zbMATH DE number 1088254
Cites work
- Advances in cryptology - CRYPTO '89. Proceedings of a conference held at the University of California, Santa Barbara, CA (USA), August 20-24, 1989
- Classical proofs for the quantum collapsing property of classical hash functions
- Collapse-binding quantum commitments without random oracles
- Computationally binding quantum commitments
- Counter-Cryptanalysis
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 3877077 (Why is no real title available?)
- New directions in cryptography
- One Way Hash Functions and DES
- Post-quantum security of the sponge construction
- Sakura: a flexible coding for tree hashing
- Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
- The first collision for full SHA-1
Cited in
(5)- Classical proofs for the quantum collapsing property of classical hash functions
- Post-quantum security of the sponge construction
- Sakura: a flexible coding for tree hashing
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
- New constructions of collapsing hashes
This page was built for publication: Collapseability of tree hashes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041240)
