Abstract
In this paper, we present a cheat-sensitive weak coin flipping (CSWCF) protocol, where no dishonest party can bias the outcome of the protocol with zero probability of being detected. More precisely, we show how to use any weak coin flipping (WCF) protocol with bias \(\epsilon <1/2\) to achieve a CSWCF protocol with bias \(\sqrt{2}/4\). In addition, we convert this CSWCF protocol to a quantum gambling protocol which has no classical counterpart. We show that this quantum gambling protocol has a modifiable bias after taking cheating strategies into consideration, and that provable security with only small cheat-punishment can be realized by assuming players’ limited sets of strategies. The properties of the protocols have been proved by assuming that no ancillary state was used. The most general cases are implied by numerical analysis but remain open.
Similar content being viewed by others
Data Availability
No datasets were generated or analyzed during the current study.
References
Blum, M.: Coin flipping by telephone a protocol for solving impossible problems. ACM SIGACT News 15(1), 23–27 (1983)
Lo, H.-K., Chau, H.F.: Why quantum bit commitment and ideal quantum coin tossing are impossible. Physica. D 120(1), 177–187 (1998)
Döscher, C., Keyl, M.: An introduction to quantum coin tossing. Fluct. Noise Lett. 2(4), R125 (2002)
Ambainis, A.: A new protocol and lower bounds for quantum coin flipping. J. Comput. Syst. Sci. 68(2), 398–416 (2004)
Mochon, C: Quantum weak coin flipping with arbitrarily small bias. http://arxiv.org/abs/0711.4114 [quant-ph], November (2007)
Mochon, C: Quantum weak coin-flipping with bias of 0.192. http://arxiv.org/abs/quant-ph/0403193, October (2004)
Mochon, C.: A large family of quantum weak coin-flipping protocols. Phys. Rev. A 72(2), 022341 (2005)
Spekkens, R.W., Rudolph, T.: Quantum protocol for cheat-sensitive weak coin flipping. Phys. Rev. Lett. 89(22), 227901 (2002)
Kent, A., Hardy, L.: Cheat sensitive quantum bit commitment. Phys. Rev. Lett. 92(15), 157901 (2004)
Aharonov, D., Ta-Shma, A., Vazirani, Umesh V., Yao, Andrew C.: Quantum bit escrow. In Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, STOC ’00, pages 705–714, New York, NY, USA, May 2000. Association for Computing Machinery
Goldenberg, L., Vaidman, L., Wiesner, S.: Quantum gambling. Phys. Rev. Lett. 82(16), 3356–3359 (1999)
Hwang, W.Y., Ahn Doyeol, H., Sung, W.: Quantum gambling using two nonorthogonal states. Phys. Rev. A 64(6), 064302 (2001)
Hwang, W.-Y., Matsumoto, K.: Quantum gambling using three nonorthogonal states. Phys. Rev. A 66(5), 052311 (2002)
Zhang, P., Zhou, X.-Q., Wang, Y.-L., Liu, B.-H., Shadbolt, P., Zhang, Y.-S., Gao, H., Li, F.-L.: Quantum gambling based on Nash-equilibrium. Npj Quantum Inf. 3(1), 1–5 (2017)
Rudolph, T., Spekkens, R.W.: Quantum state targeting. Phys. Rev. A 70(5), 052306 (2004)
Clauser, J.F., Horne, M.A., Shimony, A., Holt, R.A.: Proposed experiment to test local hidden-variable theories. Phys. Rev. Lett. 23(15), 880–884 (1969)
Cleve, R., Hoyer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004., pages 236–249, June (2004)
Mochon, C.: Serial composition of quantum coin-flipping, and bounds on cheat detection for bit-commitment. Phys. Rev. A 70(3), 032312 (2004)
Acknowledgements
The author would like to thank, sincerely, Prof. Pei Zhang and Prof. Silas R. Beane for their help
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Han, Y. Cheat-sensitive coin flipping and quantum gambling. Quantum Inf Process 21, 170 (2022). https://doi.org/10.1007/s11128-022-03515-8
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11128-022-03515-8