Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
From MaRDI portal
Publication:2220875
DOI10.1016/j.tcs.2020.11.013zbMath1477.68112OpenAlexW3103858300MaRDI QIDQ2220875
Publication date: 25 January 2021
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2020.11.013
Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (3)
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- On the power of Ambainis lower bounds
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
- Quantum to classical one-way function and its applications in quantum money authentication
- On finding quantum multi-collisions
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- On constructing one-way permutations from indistinguishability obfuscation
- The impossibility of basing one-way permutations on central cryptographic primitives
- One-way functions and the nonisomorphism of NP-complete sets
- Perfect Structure on the Edge of Chaos
- Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
- Quantum Position Verification in the Random Oracle Model
- Uniqueness Is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
- Black-Box Reductions and Separations in Cryptography
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- Non-Interactive Zero-Knowledge Proofs in the Quantum Random Oracle Model
- On Black-Box Separations among Injective One-Way Functions
- Random Oracles in a Quantum World
- Revocable Quantum Timed-Release Encryption
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption
- On the Impossibility of Three-Move Blind Signature Schemes
- Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
- Foundations of Non-malleable Hash and One-Way Functions
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- New directions in cryptography
- Breaking RSA may not be equivalent to factoring
- A Pseudorandom Generator from any One-way Function
- Quantum-Secure Message Authentication Codes
- Advances in Cryptology – CRYPTO 2004
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Limits of provable security from standard assumptions
- On the Generic Insecurity of the Full Domain Hash
- Quantum Query Complexity of State Conversion
- Quantum lower bounds by quantum arguments
- Theory of Cryptography
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
This page was built for publication: Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
