- Open Access
Honest-binding quantum bit commitment from separable operations
Phys. Rev. A 113, 062401 – Published 1 June, 2026
DOI: https://doi.org/10.1103/58t8-dj5y
Abstract
Bit commitment is a fundamental cryptographic primitive and a cornerstone for numerous two-party cryptographic protocols, including zero-knowledge proofs. However, it has been proven that unconditionally secure bit commitment, both classical and quantum, is impossible. In this work, we demonstrate that imposing a restriction on the committing party to perform only separable operations enables secure quantum bit-commitment schemes. Specifically, we prove that in any perfectly hiding bit-commitment protocol, an honestly committing party limited to separable operations will be detected with high probability if they attempt to alter their commitment. To illustrate our findings, we present an example protocol.
Physics Subject Headings (PhySH)
Article Text
References (25)
- G. Brassard, C. Crepeau, R. Jozsa, and D. Langlois, A quantum bit commitment scheme provably unbreakable by both parties, in Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science (IEEE Computer Society Press, Palo Alto, CA, 1993), pp. 362–371.
- D. Mayers, Unconditionally secure quantum bit commitment is impossible, Phys. Rev. Lett. 78, 3414 (1997).
- H.-K. Lo and H. Chau, Why quantum bit commitment and ideal quantum coin tossing are impossible, Phys. D (Amsterdam, Neth.) 120, 177 (1998).
- I. B. Damgård, S. Fehr, L. Salvail, and C. Schaffner, Cryptography in the bounded-quantum-storage model, SIAM J. Comput. 37, 1865 (2008).
- R. Koenig, S. Wehner, and J. Wullschleger, Unconditional security from noisy quantum storage, IEEE Trans. Inf. Theory 58, 1962 (2012).
- J. Kaniewski, M. Tomamichel, E. Hänggi, and S. Wehner, Secure bit commitment from relativistic constraints, IEEE Trans. Inf. Theory 59, 4687 (2013).
- L. Salvail, Quantum bit commitment from a physical assumption, in Advances in Cryptology — CRYPTO '98, edited by H. Krawczyk (Springer, Berlin, 1998), pp. 338–353.
- A. Carrera Vazquez, C. Tornow, D. Ristè, S. Woerner, M. Takita, and D. J. Egger, Combining quantum processors with real-time classical communication, Nature (London) 636, 75 (2024).
- D. Main, P. Drmota, D. P. Nadlinger, E. M. Ainley, A. Agrawal, B. C. Nichol, R. Srinivas, G. Araneda, and D. M. Lucas, Distributed quantum computing across an optical network link, Nature (London) 638, 383 (2025).
- J. Funder, Cryptography with Quantum Mechanics, Ph.D. thesis, Aarhus University, 2012.
- E. Chitambar, D. Leung, L. Mančinska, M. Ozols, and A. Winter, Everything you always wanted to know about LOCC (but were afraid to ask), Commun. Math. Phys. 328, 303 (2014).
- C. Schaffner, Cryptography in the bounded-quantum-storage model, Ph.D. thesis, University of Aarhus, 2007.
- P. Dumais, D. Mayers, and L. Salvail, Perfectly concealing quantum bit commitment from any one-way permutation, in Advances in Cryptology — EUROCRYPT 2000, edited by G. Goos, J. Hartmanis, J. van Leeuwen, and B. Preneel, Lecture Notes in Computer Science, Vol. 1807 (Springer, Berlin, 2000), pp. 300–315.
- J. Yan, General properties of quantum bit commitments (extended abstract), in Advances in Cryptology – ASIACRYPT 2022 28th International Conference on the Theory and Application of Cryptology and Information Security (Springer-Verlag, Taipei, Taiwan, Berlin, Heidelberg, 2022), pp. 628–657.
- J. Fang, D. Unruh, J. Yan, and D. Zhou, How to base security on the perfect/statistical binding property of quantum bit commitment, in 33rd International Symposium on Algorithms and Computation (ISAAC 2022), edited by S. W. Bae and H. Park, Leibniz International Proceedings in Informatics, Vol. 248 (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2022), pp. 26:1–26:12.
- If the states are not pure, we can purify them over a larger system that will be Bob's since the size of his system does not matter.
- This condition is necessary but not sufficient. The analysis of the hiding property is protocol specific, as is the case for our protocol in Sec. 3b.
- For two quantum states and , we define the fidelity as .
- M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information, 10th anniversary ed. (Cambridge University Press, Cambridge, 2012).
- W. Helwig, W. Cui, A. Riera, J. I. Latorre, and H.-K. Lo, Absolute maximal entanglement and quantum secret sharing, Phys. Rev. A 86, 052335 (2012).
- Y. Wang, Z. Hu, B. C. Sanders, and S. Kais, Qudits and high-dimensional quantum computing, Front. Phys. 8, 479 (2020).
- H. Zhou, H. Gao, N. T. Leitao, O. Makarova, I. Cong, A. M. Douglas, L. S. Martin, and M. D. Lukin, Robust Hamiltonian engineering for interacting qudit systems, Phys. Rev. X 14, 031017 (2024).
- N. Goss, A. Morvan, B. Marinelli, B. K. Mitchell, L. B. Nguyen, R. K. Naik, L. Chen, C. Jünger, J. M. Kreikebaum, D. I. Santiago, J. J. Wallman, and I. Siddiqi, High-fidelity qutrit entangling gates for superconducting circuits, Nat. Commun. 13, 7481 (2022).
- A. Cervera-Lierta, J. I. Latorre, and D. Goyeneche, Quantum circuits for maximally entangled states, Phys. Rev. A 100, 022342 (2019).
- J. Watrous, The Theory of Quantum Information (Cambridge University Press, Cambridge, 2018).