STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A new protocol and lower bounds for quantum coin flipping
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Multiparty Quantum Coin Flipping
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
High Entropy Random Selection Protocols
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Optimal Quantum Strong Coin Flipping
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Optimization of coherent attacks in generalizations of the BB84 quantum bit commitment protocol
Quantum Information & Computation
On the existence of loss-tolerant quantum oblivious transfer protocols
Quantum Information & Computation
Quantum private comparison protocol based on entanglement swapping of $$d$$-level Bell states
Quantum Information Processing
| Hi-index | 0.00 |
In this paper, we present a quantum strong coin ipping protocol. In this protocol, an EPR pair and a quantum memory storage are made use of, and losses in the quantum communication channel and quantum memory storage are all analyzed. 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. Therefore we call our protocol semi-loss-tolerant. 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. What's more, experimental feasibility is discussed and demonstrated.