General properties of quantum bit commitments (extended abstract)
From MaRDI portal
Publication:6134002
DOI10.1007/978-3-031-22972-5_22zbMATH Open1529.81062OpenAlexW4317928268MaRDI QIDQ6134002FDOQ6134002
Publication date: 21 August 2023
Published in: Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22972-5_22
Cites Work
- Title not available (Why is that?)
- Quantum cryptography: public key distribution and coin tossing
- Title not available (Why is that?)
- Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- The Theory of Quantum Information
- Bit commitment using pseudorandomness
- Perfect zero-knowledge arguments for NP using any one-way permutation
- Oblivious Transfer Is Symmetric
- Foundations of Cryptography
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
- Algorithms and Computation
- Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
- Why quantum bit commitment and ideal quantum coin tossing are impossible.
- An Equivalence Between Zero Knowledge and Commitments
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Theory of Cryptography
- Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
- Improving the Security of Quantum Protocols via Commit-and-Open
- The Curious Case of Non-Interactive Commitments – On the Power of Black-Box vs. Non-Black-Box Use of Primitives
- Title not available (Why is that?)
- A note on computational indistinguishability
- General Properties of Quantum Zero-Knowledge Proofs
- Coding theorem and strong converse for quantum channels
- Pseudorandom quantum states
- Quantum Proofs of Knowledge
- Sampling in a Quantum Population, and Applications
- Collapse-Binding Quantum Commitments Without Random Oracles
- Computationally Binding Quantum Commitments
- Oblivious transfer is in MiniQCrypt
- One-way functions imply secure computation in a quantum world
- Quantum commitments and signatures without one-way functions
- Title not available (Why is that?)
- Classical binding for quantum commitments
- Complete Problem for Perfect Zero-Knowledge Quantum Proof
- Quantum Commitments from Complexity Assumptions
- Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP
Cited In (6)
- Title not available (Why is that?)
- Black-box separations for non-interactive classical commitments in a quantum world
- Black-hole radiation decoding is quantum cryptography
- Unconditionally secure quantum commitments with preprocessing
- Unconditionally secure commitments with quantum auxiliary inputs
- Exponential quantum one-wayness and EFI pairs
This page was built for publication: General properties of quantum bit commitments (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134002)
