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.013zbMATH Open1477.68112OpenAlexW3103858300MaRDI QIDQ2220875FDOQ2220875
Authors: Shujiao Cao, Rui Xue 
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
Recommendations
- On quantum one-way permutations
- Quantum one-way permutation over the finite field of two elements
- Mathematical Foundations of Computer Science 2004
- Universal test for quantum one-way permutations
- Quantum Queries on Permutations with a Promise
- Perfectly concealing quantum bit commitment from any quantum one-way permutation
- A state-space approach to quantum permutations
- Quantum queries on permutations
- One-way functions imply secure computation in a quantum world
- scientific article; zbMATH DE number 1303132
Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Quantum cryptography: public key distribution and coin tossing
- Secure signatures and chosen ciphertext security in a quantum computing world
- Secure identity-based encryption in the quantum random oracle model
- New directions in cryptography
- A Pseudorandom Generator from any One-way Function
- How to Construct Pseudorandom Permutations from Pseudorandom Functions
- Breaking RSA may not be equivalent to factoring
- Title not available (Why is that?)
- Theory of Cryptography
- One-way functions and the nonisomorphism of NP-complete sets
- On the impossibility of three-move blind signature schemes
- 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
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Random oracles in a quantum world
- On the power of Ambainis lower bounds
- Quantum-secure message authentication codes
- Query complexity, or why is it difficult to separate \(NP^ A\cap coNP^ A\) from \(P^ A\) by random oracles A?
- Quantum lower bounds by quantum arguments
- Uniqueness is a different story: impossibility of verifiable random functions from trapdoor permutations
- IND-CCA-secure key encapsulation mechanism in the quantum random oracle model, revisited
- Title not available (Why is that?)
- Time space tradeoffs for attacks against one-way functions and PRGs
- Quantum position verification in the random oracle model
- Non-interactive zero-knowledge proofs in the quantum random oracle model
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- On black-box separations among injective one-way functions
- Limits on the power of indistinguishability obfuscation and functional encryption
- On finding quantum multi-collisions
- Foundations of non-malleable hash and one-way functions
- Quantum to classical one-way function and its applications in quantum money authentication
- How to record quantum queries, and applications to quantum indifferentiability
- Quantum security proofs using semi-classical oracles
- Revocable Quantum Timed-Release Encryption
- Black-box reductions and separations in cryptography
- On constructing one-way permutations from indistinguishability obfuscation
- The impossibility of basing one-way permutations on central cryptographic primitives
- Explicit relation between all lower bound techniques for quantum query complexity
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier?
Cited In (11)
- Black-box separations for non-interactive classical commitments in a quantum world
- On the (im)plausibility of public-key quantum money from collision-resistant hash functions
- Mathematical Foundations of Computer Science 2004
- Towards compressed permutation oracles
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- On quantum one-way permutations
- Quantum one-way permutation over the finite field of two elements
- Universal test for quantum one-way permutations
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- The gap is sensitive to size of preimages: collapsing property doesn't go beyond quantum collision-resistance for preimages bounded hash functions
- On the impossibility of key agreements from quantum random oracles
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2220875)
