On the composable security of weak coin flipping
arXiv:2402.15233 · doi:10.22331/q-2025-06-24-1780
Abstract
Weak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed from noiseless quantum communication channels, its composability remains unexplored. In this work, we demonstrate that no weak coin flipping protocol can be abstracted as a simple black-box resource with composable security. Despite this, we also establish the overall stand-alone security of quantum weak coin flipping protocols under composition in sequential order.
29 pages, 9 figures; Presented in Qcrypt2024, Vigo
References in corpus (16)
- Theoretical framework for quantum networks
- Universal blind quantum computation
- Locking classical correlation in quantum states
- Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
- Locking of accessible information and implications for the security of quantum cryptography
- Universally Composable Quantum Multi-Party Computation
- Toward a general theory of quantum games
- Composable security of delegated quantum computation
- Multiparty Quantum Coin Flipping
- Quantum weak coin flipping with arbitrarily small bias
- Secure bit commitment from relativistic constraints
- Causal Boxes: Quantum Information-Processing Systems Closed under Composition
- Composable security in relativistic quantum cryptography
- The Impossibility of Efficient Quantum Weak Coin-Flipping
- Quantum Weak Coin Flipping
- A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model