General properties of quantum bit commitments (extended abstract)

DOI10.1007/978-3-031-22972-5_22zbMath1529.81062OpenAlexW4317928268MaRDI QIDQ6134002

Unnamed Author

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

zbMATH Keywords

round complexityquantum bit commitmentparallel compositionquantum binding

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

Black-box separations for non-interactive classical commitments in a quantum world, Black-hole radiation decoding is quantum cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quantum cryptography: public key distribution and coin tossing
• Pseudorandom quantum states
• Bit commitment using pseudorandomness
• A note on computational indistinguishability
• Perfect zero-knowledge arguments for NP using any one-way permutation
• Why quantum bit commitment and ideal quantum coin tossing are impossible.
• Oblivious transfer is in MiniQCrypt
• One-way functions imply secure computation in a quantum world
• Classical binding for quantum commitments
• Complete Problem for Perfect Zero-Knowledge Quantum Proof
• 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
• Quantum Commitments from Complexity Assumptions
• Improving the Security of Quantum Protocols via Commit-and-Open
• Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
• Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)
• Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
• Sampling in a Quantum Population, and Applications
• Oblivious Transfer Is Symmetric
• Foundations of Cryptography
• Coding theorem and strong converse for quantum channels
• The Theory of Quantum Information
• Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function
• Algorithms and Computation
• Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments
• Advances in Cryptology – CRYPTO 2004
• General Properties of Quantum Zero-Knowledge Proofs
• An Equivalence Between Zero Knowledge and Commitments
• Computationally Binding Quantum Commitments
• Theory of Cryptography
• Quantum commitments and signatures without one-way functions
• Quantum computationally predicate-binding commitments with application in quantum zero-knowledge arguments for NP