Collapseability of Tree Hashes

DOI10.1007/978-3-030-44223-1_28zbMath1500.94030OpenAlexW3015681530MaRDI QIDQ5041240

Bart Mennink, Aldo Gunsing

Publication date: 13 October 2022

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44223-1_28

zbMATH Keywords

compositioncollision resistancetree hashingcollapseability

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Unnamed Item
• 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
• Post-quantum security of the sponge construction
• The first collision for full SHA-1
• How to record quantum queries, and applications to quantum indifferentiability
• Counter-Cryptanalysis
• Collapse-Binding Quantum Commitments Without Random Oracles
• Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
• New directions in cryptography
• Sakura: A Flexible Coding for Tree Hashing
• Computationally Binding Quantum Commitments
• One Way Hash Functions and DES

This page was built for publication: Collapseability of Tree Hashes