Honest-binding quantum bit commitment from separable operations
arXiv:2501.07351 · doi: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.
References in corpus (9)
- Qudits and high-dimensional quantum computing
- Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
- Absolute Maximal Entanglement and Quantum Secret Sharing
- Distributed Quantum Computing across an Optical Network Link
- Unconditional security from noisy quantum storage
- High-Fidelity Qutrit Entangling Gates for Superconducting Circuits
- Combining quantum processors with real-time classical communication
- Quantum circuits for maximally entangled states
- Secure bit commitment from relativistic constraints