Fair loss-tolerant and quantum-memory-loss-sensitive SCF protocol based on EPR pair

In this paper, we present a novel loss-tolerant quantum strong coin flipping (SCF) protocol. Compared with previous qubit-based loss-tolerant SCF protocols, we introduce the EPR pair to keep our protocol loss-tolerant while trying to push down the bias. In addition, losses in the quantum memory storage besides those in the quantum channel are also taken into account. We obtain the bias in the fair scenario as a function of p, where p is the probability that the particle in Bob’s quantum memory storage is lost, which means our bias varies as the degree of losses in the quantum memory storage changes. We also show that the bias decreases with decreasing p. When p approaches 0, the bias approaches 0.3536, which is less than that of all the previous loss-tolerant protocols. Details of both parties’ optimal cheating strategies are also given and analyzed.

[1]  Quantum coin tossing and bit-string generation in the presence of noise (6 pages) , 2003, quant-ph/0303182.

[2]  Serge Massar,et al.  Security of quantum bit-string generation , 2004 .

[3]  Andris Ambainis,et al.  A new protocol and lower bounds for quantum coin flipping , 2001, STOC '01.

[4]  A. Chailloux Improved Loss-Tolerant Quantum Coin Flipping , 2010, 1009.0044.

[5]  Andrew Chi-Chih Yao,et al.  Quantum bit escrow , 2000, STOC '00.

[6]  Iordanis Kerenidis,et al.  Optimal Quantum Strong Coin Flipping , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[7]  Manuel Blum,et al.  Coin Flipping by Telephone. , 1981, CRYPTO 1981.

[8]  Yevgeniy Dodis,et al.  Multiparty quantum coin flipping , 2004 .

[9]  Robert W. Spekkens,et al.  Optimization of coherent attacks in generalizations of the BB84 quantum bit commitment protocol , 2002, Quantum Inf. Comput..

[10]  T. Rudolph,et al.  Degrees of concealment and bindingness in quantum bit commitment protocols , 2001, quant-ph/0106019.

[11]  Hoi-Kwong Lo,et al.  Is Quantum Bit Commitment Really Possible? , 1996, ArXiv.

[12]  F. Bussières,et al.  Fair Loss-Tolerant Quantum Coin Flipping , 2009, 0904.3945.

[13]  S. Massar,et al.  Family of loss-tolerant quantum coin-flipping protocols , 2010 .

[14]  R W Spekkens,et al.  Quantum protocol for cheat-sensitive weak coin flipping. , 2002, Physical review letters.

[15]  N. Aharon,et al.  Quantum dice rolling: a multi-outcome generalization of quantum coin flipping , 2009, 0909.4186.

[16]  Dominic Mayers Unconditionally secure quantum bit commitment is impossible , 1997 .

[17]  S. Massar,et al.  Experimental quantum tossing of a single coin , 2008, 0804.4411.

[18]  Nikolai K. Vereshchagin,et al.  High Entropy Random Selection Protocols , 2007, Algorithmica.