On the impossibility of key agreements from quantum random oracles
From MaRDI portal
Operations and polynomials in algebraic structures, primal algebras (08A40) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)
Recommendations
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- Classical verification of quantum computations with efficient verifier
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- scientific article; zbMATH DE number 7651035 (Why is no real title available?)
- Key agreement from weak bit agreement
- Key establishment à la Merkle in a quantum world
- Limits of random oracles in secure computation (extended abstract)
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Limits on the usefulness of random oracles
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- New directions in cryptography
- Non-interactive classical verification of quantum computation
- On the Communication Complexity of Key-Agreement Protocols.
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- On the concurrent composition of quantum zero-knowledge
- On the Fourier tails of bounded functions over the discrete cube
- Post-quantum multi-party computation
- Post-quantum resettably-sound zero knowledge
- Post-quantum zero knowledge in constant rounds
- Quantum computing, postselection, and probabilistic polynomial-time
- Quantum cryptography: public key distribution and coin tossing
- Secure quantum computation with classical communication
- Succinct blind Quantum computation using a random oracle
- The Complexity of Public-Key Cryptography
- The need for structure in quantum speedups
- Theory of Cryptography
- Uniform generation of NP-witnesses using an NP-oracle
Cited in
(19)- A Note on the Instantiability of the Quantum Random Oracle
- 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
- Public-key encryption with quantum keys
- On the (im)possibility of time-lock puzzles in the quantum random oracle model
- Influences of Fourier completely bounded polynomials and classical simulation of quantum algorithms
- How (not) to build quantum PKE in Minicrypt
- On central primitives for quantum cryptography with classical communication
- On the power of oblivious state preparation
- On quantum money and evasive obfuscation
- Quantum public-key encryption of quantum states, and more
- Cryptography in the common Haar state model: feasibility results and separations
- Verifiable quantum advantage without structure
- On the limitations of pseudorandom unitaries. Or: cryptographic applications of LOCC indistinguishability of identical versus independent Haar unitaries
- Separating pseudorandom codes from local oracles
- The black-box simulation barrier persists in a fully quantum world
- On the efficiency of generic, quantum cryptographic constructions
- Towards the impossibility of quantum public key encryption with classical keys from one-way functions
- Quantum black-box separations: succinct non-interactive arguments from falsifiable assumptions
This page was built for publication: On the impossibility of key agreements from quantum random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6104333)
