Minimum disclosure proofs of knowledge
Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Quantum Bit Commitment and Coin Tossing Protocols
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Committed Oblivious Transfer and Private Multi-Party Computation
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Secure Classical Bit Commitment Using Fixed Capacity Communication Channels
Journal of Cryptology
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
A quantum bit commitment scheme provably unbreakable by both parties
SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Cheat sensitive quantum bit commitment via pre- and post-selected quantum states
Quantum Information Processing
Hi-index | 0.00 |
Recently, Choi et al. proposed an assumption on Mayers---Lo---Chau (MLC) no-go theorem that the state of the entire quantum system is invariable to both participants before the unveiling phase. This makes us suspect that the theorem is only applicable to static quantum bit commitment (QBC). This paper clarifies that the MLC no-go theorem can be applied to not only static QBC, but also non-static one. A non-static QBC protocol proposed by Choi et al. is briefly reviewed and analyzed to work as a supporting example. In addition, a novel way to prove the impossibility of the two kinds of QBC is given.