Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0703099 · Physical Review Letters

Dilemma that Cannot Be Resolved by Biased Quantum Coin Flipping

Satoshi Ishizaka

Published Feb 19, 2008• 7 citations
arXivHTMLPDF

Abstract

We show that a biased quantum coin flip (QCF) cannot provide the performance of a black-boxed biased coin flip, if it satisfies some fidelity conditions. Although such a QCF satisfies the security conditions of a biased coin flip, it does not realize the ideal functionality and, therefore, does not satisfy the demands for universally composable security. Moreover, through a comparison within a small restricted bias range, we show that an arbitrary QCF is distinguishable from a black-boxed coin flip unless it is unbiased on both sides of parties against insensitive cheating. We also point out the difficulty in developing cheat-sensitive quantum bit commitment in terms of the uncomposability of a QCF.

DOI
10.1103/physrevlett.100.070501

Related papers

Composability of biased quantum coin flipping

Satoshi Ishizaka, Alexander I. Lvovsky

A biased quantum coin flip (QCF) does not realize the functionality of a classical black‐boxed coin flip, if it satisfies some fidelity condition. We consider a quantum black‐boxed coin flip and show that the fidelity condition is well‐explained as the functionality of the quantum black‐boxed coin flip. Moreover, we show the results of the security analysis for a QCF like protocol.

AIP conference proceedings•Jan 1, 2009•0 citations

Unconditionally secure quantum coin flipping

Guang Ping He

Quantum coin flipping (QCF) is an essential primitive for quantum cryptography. Unconditionally secure strong QCF with an arbitrarily small bias was widely believed to be impossible. But basing on a problem which cannot be solved without quantum algorithm, here we propose such a QCF protocol, and show how it manages to evade all existing no-go proofs on QCF.

arXiv:1602.01430•Results in Physics•Mar 30, 2023•0 citations

Quantum coin flipping secure against channel noises

Sheng Zhang, Yuexin Zhang

So far, most existing single-shot quantum coin flipping (QCF) protocols have failed in a noisy quantum channel. Here, we present a nested-structure framework that makes it possible to achieve partially noise-tolerant QCF, due to a trade-off between the security and the justice correctness. It is showed that noise-tolerant single-shot QCF protocols can be produced by filling the presented framework up with existing or even future protocols. We also proved a lower bound of 0.25, with which a cheating Alice or Bob could bias the outcome.

Physical Review A•Aug 7, 2015•2 citations

On the composable security of weak coin flipping

Jiawei Wu, Yanglin Hu, Akshay Bansal +1 more

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.

arXiv:2402.15233•Quantum•Jun 24, 2025•1 citation

Quantum coin flipping with arbitrary small bias is impossible

Tokunaga, Yuki

Lo and Chau showed that an ideal quantum coin flipping protocol is impossible. The proof was simply derived from the impossibility proof of quantum bit commitment. However, the proof still leaves the possibility of a quantum coin flipping protocol with arbitrary small bias. In this paper, we show that a quantum coin flipping protocol with arbitrary small bias is impossible and show the lower bound of the bias of quantum coin flipping protocol.

arXiv:quant-ph/0108026•Aug 6, 2001•1 citation

Serial composition of quantum coin flipping and bounds on cheat detection for bit commitment

Carlos Mochon

Quantum protocols for coin flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in the bias (or bit-commitment protocols with linear cheat detection) because these can be composed to produce strong coin flipping with arbitrarily small bias. On the other hand, it appears that quadratic cheat detection cannot be composed in series to obtain even weak coin flipping with arbitrarily small bias.

arXiv:quant-ph/0311165•Physical Review A•Sep 17, 2004•8 citations
We show that a biased quantum coin flip (QCF) cannot provide the performance of a black-boxed biased coin flip, if it satisfies some fidelity conditions. Although such a QCF satisfies the security conditions of a biased coin flip, it does not realize the ideal functionality and, therefore, does not satisfy the demands for universally composable security. Moreover, through a comparison within a small restricted bias range, we show that an arbitrary QCF is distinguishable from a black-boxed coin flip unless it is unbiased on both sides of parties against insensitive cheating. We also point out the difficulty in developing cheat-sensitive quantum bit commitment in terms of the uncomposability of a QCF.
So far, most existing single-shot quantum coin flipping (QCF) protocols have failed in a noisy quantum channel. Here, we present a nested-structure framework that makes it possible to achieve partially noise-tolerant QCF, due to a trade-off between the security and the justice correctness. It is showed that noise-tolerant single-shot QCF protocols can be produced by filling the presented framework up with existing or even future protocols. We also proved a lower bound of 0.25, with which a cheating Alice or Bob could bias the outcome.
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.
Quantum protocols for coin flipping can be composed in series in such a way that a cheating party gains no extra advantage from using entanglement between different rounds. This composition principle applies to coin-flipping protocols with cheat sensitivity as well, and is used to derive two results: There are no quantum strong coin-flipping protocols with cheat sensitivity that is linear in the bias (or bit-commitment protocols with linear cheat detection) because these can be composed to produce strong coin flipping with arbitrarily small bias. On the other hand, it appears that quadratic cheat detection cannot be composed in series to obtain even weak coin flipping with arbitrarily small bias.