Black-box separations for non-interactive classical commitments in a quantum world
From MaRDI portal
Publication:6138082
DOI10.1007/978-3-031-30545-0_6MaRDI QIDQ6138082
Kai-Min Chung, Yaoting Lin, Mohammad Mahmoody
Publication date: 16 January 2024
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudorandom quantum states
- Hardness vs randomness
- Oblivious transfer is in MiniQCrypt
- Scalable pseudorandom quantum states
- Non-interactive classical verification of quantum computation
- Classical verification of quantum computations with efficient verifier
- One-way functions imply secure computation in a quantum world
- Quantum random oracle model with auxiliary input
- 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
- Finding collisions in a quantum world: quantum black-box separation of collision-resistance and one-wayness
- Secure quantum computation with classical communication
- Classical binding for quantum commitments
- Notions of Black-Box Reductions, Revisited
- Quantum Proofs of Knowledge
- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
- Collapse-Binding Quantum Commitments Without Random Oracles
- On Black-Box Separations among Injective One-Way Functions
- Uncertainty Principles and Signal Recovery
- Quantum Computation and Quantum Information
- Random Oracles in a Quantum World
- Merkle Puzzles Are Optimal — An O(n2)-Query Attack on Any Key Exchange from a Random Oracle
- Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
- A Pseudorandom Generator from any One-way Function
- Strengths and Weaknesses of Quantum Computing
- Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
- Advances in Cryptology - CRYPTO 2003
- Computationally Binding Quantum Commitments
- The uncertainty principle: Variations on a theme
- Theory of Cryptography
- Theory of Cryptography
- Succinct blind Quantum computation using a random oracle
- Cryptography from pseudorandom quantum states
- Quantum commitments and signatures without one-way functions
- On the impossibility of key agreements from quantum random oracles
- General properties of quantum bit commitments (extended abstract)
This page was built for publication: Black-box separations for non-interactive classical commitments in a quantum world