Honest-binding quantum bit commitment from separable operations
Open Access
- 1 June 2026
- journal article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (6)
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.Keywords
All Related Versions
Funding Information
- Deutsche Forschungsgemeinschaft (41829458)
- Ministero dell'Università e della Ricerca (816000-2022-SQUID - CUP F83C22002390007)
This publication has 15 references indexed in Scilit:
- Distributed quantum computing across an optical network linkNature, 2025
- Combining quantum processors with real-time classical communicationNature, 2024
- High-fidelity qutrit entangling gates for superconducting circuitsNature Communications, 2022
- Quantum circuits for maximally entangled statesPhysical Review A, 2019
- The Theory of Quantum Information2018
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)Communications in Mathematical Physics, 2014
- Absolute maximal entanglement and quantum secret sharingPhysical Review A, 2012
- Quantum Computation and Quantum Information2012
- Why quantum bit commitment and ideal quantum coin tossing are impossiblePhysica D: Nonlinear Phenomena, 1998
- Unconditionally Secure Quantum Bit Commitment is ImpossiblePhysical Review Letters, 1997