On the impossibility of key agreements from quantum random oracles
From MaRDI portal
Publication:6104333
DOI10.1007/978-3-031-15979-4_6zbMath1527.81037MaRDI QIDQ6104333
Per Austrin, Mohammad Mahmoody, Yaoting Lin, Hao Chung, Kai-Min Chung, Shiuan Fu
Publication date: 28 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Cryptography (94A60) Operations and polynomials in algebraic structures, primal algebras (08A40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Limits on the usefulness of random oracles
- Quantum cryptography: public key distribution and coin tossing
- Uniform generation of NP-witnesses using an NP-oracle
- Post-quantum multi-party computation
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- Non-interactive classical verification of quantum computation
- Classical verification of quantum computations with efficient verifier
- On the concurrent composition of quantum zero-knowledge
- Being a permutation is also orthogonal to one-wayness in quantum world: impossibilities of quantum one-way permutations from one-wayness primitives
- How to record quantum queries, and applications to quantum indifferentiability
- Key establishment à la Merkle in a quantum world
- Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Secure quantum computation with classical communication
- Post-quantum resettably-sound zero knowledge
- On the fourier tails of bounded functions over the discrete cube
- Limits of random oracles in secure computation
- Limits on the Power of Zero-Knowledge Proofs in Cryptographic Constructions
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Key agreement from weak bit agreement
- New directions in cryptography
- A method for obtaining digital signatures and public-key cryptosystems
- The Complexity of Public-Key Cryptography
- On the Communication Complexity of Key-Agreement Protocols.
- Post-quantum zero knowledge in constant rounds
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Quantum computing, postselection, and probabilistic polynomial-time
- Basing Weak Public-Key Cryptography on Strong One-Way Functions
- Theory of Cryptography
- Succinct blind Quantum computation using a random oracle
This page was built for publication: On the impossibility of key agreements from quantum random oracles
