arXiv:1602.01430 · Results in Physics

Unconditionally secure quantum coin flipping

Guang Ping He

Published Mar 30, 2023• 0 citations

Abstract

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.

DOI: 10.1016/j.rinp.2023.106398

Related papers

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/0108026Aug 6, 20011 citation

Dilemma that Cannot Be Resolved by Biased Quantum Coin Flipping

Satoshi Ishizaka

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.

arXiv:quant-ph/0703099Physical Review LettersFeb 19, 20087 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 AAug 7, 20152 citations

Experimental loss-tolerant quantum coin flipping

Guido Berlín, Gilles Brassard A, Félix Bussières +3 more

Coin flipping is a cryptographic primitive in which two distrustful parties wish to generate a random bit to choose between two alternatives. This task is impossible to realize when it relies solely on the asynchronous exchange of classical bits: one dishonest player has complete control over the final outcome. It is only when coin flipping is supplemented with quantum communication that this problem can be alleviated, although partial bias remains. Unfortunately, practical systems are subject to loss of quantum data, which allows a cheater to force a bias that is complete or arbitrarily close to complete in all previous protocols and implementations. Here we report on the first experimental demonstration of a quantum coin-flipping protocol for which loss cannot be exploited to cheat better. By eliminating the problem of loss, which is unavoidable in any realistic setting, quantum coin flipping takes a significant step towards real-world applications of quantum communication. When two spatially separated parties flip a coin, it is impossible to choose between two alternatives in an unbiased manner. This study presents a quantum coin-flipping protocol that overcomes this problem and ensures a dishonest party cannot bias the outcome completely.

arXiv:0904.3946Nature CommunicationsNov 29, 201154 citations

Protocols for Quantum Weak Coin Flipping

Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou +1 more

Weak coin flipping is an important cryptographic primitive$\unicode{x2013}$it is the strongest known secure two-party computation primitive that classically becomes secure only under certain assumptions (e.g. computational hardness), while quantumly there exist protocols that achieve arbitrarily close to perfect security. This breakthrough result was established by Mochon in 2007 [arXiv:0711.4114]. However, his proof relied on the existence of certain unitary operators which was established by a non-constructive argument. Consequently, explicit protocols have remained elusive. In this work, we give exact constructions of related unitary operators. These, together with a new formalism, yield a family of protocols approaching perfect security thereby also simplifying Mochon's proof of existence. We illustrate the construction of explicit weak coin flipping protocols by considering concrete examples (from the aforementioned family of protocols) that are more secure than all previously known protocols. 76 pages. This is the TheoretiCS journal version

arXiv:2402.15855TheoretiCSNov 26, 20250 citations

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 proceedingsJan 1, 20090 citations