New constructions of collapsing hashes

DOI10.1007/978-3-031-15982-4_20MaRDI QIDQ6163967zbMATH OpenFDO

Authors Mark Zhandry

Publication date 30 June 2023

Published in Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15982-4_20

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94) Open systems, reduced dynamics, master equations, decoherence (81S22) Elliptic curves (14H52) Regularization by noise (60H50)

Recommendations

• Post-quantum security of the sponge construction
• Classical proofs for the quantum collapsing property of classical hash functions
• The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
• Collapseability of tree hashes
• Collision resistant hashing from sub-exponential learning parity with noise

Cites work

• A Pseudorandom Generator from any One-way Function
• A black-box approach to post-quantum zero-knowledge in constant rounds
• Collapse-binding quantum commitments without random oracles
• Collision resistant hashing from sub-exponential learning parity with noise
• Computationally binding quantum commitments
• Cryptographic hash functions from expander graphs
• Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
• Full Cryptanalysis of LPS and Morgenstern Hash Functions
• How to record quantum queries, and applications to quantum indifferentiability
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• On lattices, learning with errors, random linear codes, and cryptography
• One-shot signatures and applications to hybrid quantum/classical authentication
• Quantum collision attacks on reduced SHA-256 and SHA-512
• Quantum indistinguishability of random sponges
• Quantum lightning never strikes the same state twice
• Quantum-access-secure message authentication via blind-unforgeability
• Revisiting post-quantum Fiat-Shamir
• Security analysis of quantum lightning
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
• Worst-case hardness for LPN and cryptographic hashing via code smoothing

Cited in

(6)

• Advances in Cryptology – CRYPTO 2004
• On one-shot signatures, quantum vs. classical binding, and obfuscating permutations
• Collisions for the LPS Expander Graph Hash Function
• Lossy cryptography from code-based assumptions
• The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
• Lossy cryptography from code-based assumptions dense-sparse LPN: a new subexponentially hard LPN variant in SZK

This page was built for publication: New constructions of collapsing hashes

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