A quantum protocol for cheat-sensitive weak coin flipping

Abstract

We present a quantum protocol for the task of weak coin flipping. We find that, for one choice of parameters in the protocol, the maximum probability of a dishonest party winning the coin flip if the other party is honest is 1/sqrt(2). We also show that if parties restrict themselves to strategies wherein they cannot be caught cheating, their maximum probability of winning can be even smaller. As such, the protocol offers additional security in the form of cheat sensitivity.

4 pages RevTex. Differs from the journal version only in that the sentences: "The ordering of the authors on this paper was chosen by a coin flip implemented by a trusted third party. TR lost." have not been removed

References in corpus (1)

• Degrees of concealment and bindingness in quantum bit commitment protocols

Cited by in corpus (39)

• Spatial correlations in parametric down-conversion
• Quantum Mechanics as Quantum Information (and only a little more)
• Locking classical correlation in quantum states
• Experimental demonstration of graph-state quantum secret sharing
• Experimental Quantum Coin Tossing
• On the communication complexity of establishing a shared reference frame
• On bit-commitment based quantum coin flipping
• Experimental plug&play quantum coin flipping
• Time-efficient implementation of quantum search with qudits
• Quantum weak coin flipping with arbitrarily small bias
• Multiparty Quantum Coin Flipping
• A large family of quantum weak coin-flipping protocols
• Quantum dice rolling: A multi-outcome generalization of quantum coin flipping
• Variable Bias Coin Tossing
• Quantum coin tossing and bit-string generation in the presence of noise
• Provably Secure Experimental Quantum Bit-String Generation
• Practical Quantum Coin Flipping
• Multiphoton and side-channel attacks in mistrustful quantum cryptography
• Quantum weak coin flipping with a single photon
• Lower bound for a class of weak quantum coin flipping protocols
• Quantum Protocol for Decision Making and Verifying Truthfulness among $N$-quantum Parties: Solution and Extension of the Quantum Coin Flipping Game
• Quantum cryptography beyond key distribution: theory and experiment
• Security of Quantum Bit-String Generation
• Tight bounds for classical and quantum coin flipping
• Quantum state targeting
• A family of loss-tolerant quantum coin flipping protocols
• The Impossibility of Efficient Quantum Weak Coin-Flipping
• Serial composition of quantum coin-flipping, and bounds on cheat detection for bit-commitment
• Dilemma that cannot be resolved by biased quantum coin flipping
• Transition of D- Level Quantum Systems Through Quantum Channels with Correlated Noise
• A simpler proof of existence of quantum weak coin flipping with arbitrarily small bias
• Single-Photon Advantage in Quantum Cryptography Beyond QKD
• Continuous Variable Quantum Advantages and Applications in Quantum Optics
• Bit Commitment for Lottery and Auction on Quantum Blockchain
• Semi-loss-tolerant strong quantum coin-flipping protocol using quantum non-demolition measurement
• Experimental cheat-sensitive quantum weak coin flipping
• Impossibility of Quantum Private Queries
• A Quadratic Speedup in Finding Nash Equilibria of Quantum Zero-Sum Games
• Unconditionally secure quantum coin flipping