Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
From MaRDI portal
Publication:6617635
Recommendations
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- On the complexity of collision resistant hash functions: new and old black-box separations
- Quantum collision-resistance of non-uniformly distributed functions
- Quantum lower bounds for the collision and the element distinctness problems
Cites work
- scientific article; zbMATH DE number 3825698 (Why is no real title available?)
- scientific article; zbMATH DE number 176554 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1303133 (Why is no real title available?)
- scientific article; zbMATH DE number 1942447 (Why is no real title available?)
- A note on quantum security for post-quantum cryptography
- Adaptive versus non-adaptive strategies in the quantum setting with applications
- Advances in Cryptology – CRYPTO 2004
- Black-box reductions and separations in cryptography
- Classical hardness of learning with errors
- Computational Security of Quantum Encryption
- Computationally binding quantum commitments
- Feasibility and completeness of cryptographic tasks in the quantum world
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- How to use indistinguishability obfuscation
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
- Limits of provable security from standard assumptions
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Merkle puzzles in a quantum world
- Notions of black-box reductions, revisited
- On lattices, learning with errors, random linear codes, and cryptography
- On the Generic Insecurity of the Full Domain Hash
- On the complexity of collision resistant hash functions: new and old black-box separations
- On the power of nonuniformity in proofs of security
- Possibility and impossibility results for selective decommitments
- Public-key cryptosystems from the worst-case shortest vector problem
- Quantum FHE (almost) as secure as classical
- Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
- Quantum computation and quantum information. 10th anniversary edition
- Quantum cryptanalysis of hash and claw-free functions
- Quantum cryptography beyond quantum key distribution
- Quantum lightning never strikes the same state twice
- Quantum random oracle model with auxiliary input
- Random oracles with(out) programmability
- Revisiting post-quantum Fiat-Shamir
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Strengths and Weaknesses of Quantum Computing
- The Fiat-Shamir transformation in a quantum world
- Theory of Cryptography
- Time space tradeoffs for attacks against one-way functions and PRGs
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Unforgeable quantum encryption
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- Witness encryption and its applications
Cited in
(1)
This page was built for publication: Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617635)
