Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness

DOI10.1007/978-3-030-64837-4_1OpenAlexW3110818649MaRDI QIDQ2692335

Takashi Yamakawa, Akinori Hosoyamada

Publication date: 21 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64837-4_1

zbMATH Keywords

post-quantum cryptographyimpossibilitycollision resistant hash functionone-way permutationquantum reductionfully black-box reductionone-way trapdoor permutation

Mathematics Subject Classification ID

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

Related Items (4)

On the impossibility of key agreements from quantum random oracles ⋮ The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions ⋮ Black-box separations for non-interactive classical commitments in a quantum world ⋮ On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model

Uses Software

• Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum FHE (almost) as secure as classical
• Quantum cryptography beyond quantum key distribution
• Unforgeable quantum encryption
• On the complexity of collision resistant hash functions: new and old black-box separations
• Quantum random oracle model with auxiliary input
• Quantum lightning never strikes the same state twice
• Computational Security of Quantum Encryption
• On the power of nonuniformity in proofs of security
• Quantum Computation and Quantum Information
• Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
• Quantum money from hidden subspaces
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
• Strengths and Weaknesses of Quantum Computing
• Public-key cryptosystems from the worst-case shortest vector problem
• Advances in Cryptology – CRYPTO 2004
• Classical hardness of learning with errors
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography
• Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?

This page was built for publication: Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness