General properties of quantum bit commitments (extended abstract)

DOI10.1007/978-3-031-22972-5_22zbMATH Open1529.81062OpenAlexW4317928268MaRDI QIDQ6134002FDOQ6134002

Authors: Jun Yan 

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)

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?)
• Perfectly concealing quantum bit commitment from any quantum one-way permutation
• 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)