The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
From MaRDI portal
Publication:6108995
DOI10.1007/978-3-031-15982-4_19zbMath1527.81040OpenAlexW4312351330MaRDI QIDQ6108995
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_19
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Particle decays (81U90) Quantum state tomography, quantum state discrimination (81P18)
Related Items (2)
New constructions of collapsing hashes ⋮ Publicly-verifiable deletion via target-collapsing functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Classical proofs for the quantum collapsing property of classical hash functions
- Post-quantum security of the sponge construction
- Multi-collision resistant hash functions and their applications
- Collision resistant hashing for paranoids: dealing with multiple collisions
- On distributional collision resistant hashing
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Quantum lightning never strikes the same state twice
- Distributional collision resistance beyond one-way functions
- Quantum security of hash functions and property-preservation of iterated hashing
- How to record quantum queries, and applications to quantum indifferentiability
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Simple constructions from (almost) regular one-way functions
- Perfect Structure on the Edge of Chaos
- Mitigating Multi-target Attacks in Hash-Based Signatures
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- On the randomness complexity of efficient sampling
- Collapse-Binding Quantum Commitments Without Random Oracles
- Collision-Free Hashing from Lattice Problems
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- Universal Arguments and their Applications
- One-shot signatures and applications to hybrid quantum/classical authentication
- Multi-collision resistance: a paradigm for keyless hash functions
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Obfuscation of Probabilistic Circuits and Applications
- Advances in Cryptology – CRYPTO 2004
- How to Build a Hash Function from Any Collision-Resistant Function
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Fast Software Encryption
- Computationally Binding Quantum Commitments
- Theory of Cryptography
- New constructions of collapsing hashes
This page was built for publication: The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
