Dilemma that cannot be resolved by biased quantum coin flipping
arXiv:quant-ph/0703099 · doi:10.1103/PhysRevLett.100.070501
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 fulfill 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.
5 pages and 1 figure. Accepted version
References in corpus (9)
- A computable measure of entanglement
- The logarithmic negativity: A full entanglement monotone that is not convex
- Unconditionally secure quantum bit commitment is impossible
- Is Quantum Bit Commitment Really Possible?
- Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
- Reexamination of Quantum Bit Commitment: the Possible and the Impossible
- Cheat Sensitive Quantum Bit Commitment
- A quantum protocol for cheat-sensitive weak coin flipping
- An Entanglement-Based Protocol For Strong Coin Tossing With Bias 1/4