×

Game theoretic security of quantum bit commitment. (English) Zbl 1448.81298

Summary: Due to the threat posed by quantum computing, there has been an increasingly focus on designing secure and efficient quantum-based and post-quantum cryptographic protocols. In this paper, we study and propose a quantum bit commitment (QBC) protocol inspired by the framework of categorical quantum mechanics. We show that our protocol is more secure and simpler than most existing cheat-sensitive QBC protocols. Then, we introduce the notion of game theoretic security, and demonstrate that such a notion is less demanding than unconditional security, yet stricter than cheat-sensitive. We show that our protocol is game theoretic secure for many commitment games. Being game theoretic secure opens the door of applying our protocol to game theory. Specifically, we show that our protocol can be used to implement equilibrium in commitment games. Finally, we run experiments on the IBM quantum computer to demonstrate the practicability of our protocol.

MSC:

81P94 Quantum cryptography (quantum-theoretic aspects)
91A80 Applications of game theory
91A11 Equilibrium refinements
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Adlam, E.; Kent, A., Device-independent relativistic quantum bit commitment, Phys. Rev. A, 92, 022315, 1-9 (2015)
[2] Asharov, G.; Canetti, R.; Hazay, C., Towards a game theoretic view of secure computation, (Paterson, K. G., Advances in Cryptology - EUROCRYPT 2011 - 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, May 15-19, 2011. Proceedings, volume 6632 of Lecture Notes in Computer Science (2011), Springer), 426-445 · Zbl 1290.94143
[3] Backens, M.; Perdrix, S.; Wang, Q., A simplified stabilizer zx-calculus, (Duncan, R.; Heunen, C., Proceedings 13th International Conference on Quantum Physics and Logic, QPL 2016, Glasgow, Scotland, 6-10 June 2016., volume 236 of EPTCS (2016)), 1-20 · Zbl 1484.18017
[4] Bennetta, C.; Brassard, G., Quantum cryptography: Public key distribution and coin tossing, Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, 175-179 (1984)
[5] Brassard, G.; Crépeau, C., Quantum bit commitment and coin tossing protocols, (Menezes, A.; Vanstone, S. A., Advances in Cryptology - CRYPTO ’90, 10th Annual International Cryptology Conference (1990), Springer), 49-61 · Zbl 0800.68415
[6] Brassard, G.; Crépeau, C.; Jozsa, R.; Langlois, D., A quantum bit commitment scheme provably unbreakable by both parties, 34th Annual Symposium on Foundations of Computer Science, Palo Alto, California, USA, 3-5 November 1993, 362-371 (1993), IEEE Computer Society
[7] Buhrman, H.; Christandl, M.; Hayden, P.; Lo, H.-K.; Wehner, S., Possibility, impossibility, and cheat sensitivity of quantum-bit string commitment, Phys. Rev. A, 78, 022316, 1-10 (2008)
[8] Coecke, B.; Duncan, R., Interacting quantum observables, (Aceto, L.; Damgård, I.; Goldberg, L. A.; Halldórsson, M. M.; Ingólfsdóttir, A.; Walukiewicz, I., Automata, Languages and Programming, 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II - Track B: Logic, Semantics, and Theory of Programming & Track C: Security and Cryptography Foundations, volume 5126 of Lecture Notes in Computer Science (2008), Springer), 298-310 · Zbl 1155.81316
[9] Coecke, B.; Duncan, R., Interacting quantum observables: categorical algebra and diagrammatics, New J. Phys., 13, 043016, 1-85 (2011) · Zbl 1448.81025
[10] Conitzer, V.; Sandholm, T., Computing the optimal strategy to commit to, (Feigenbaum, J.; Chuang, J. C.; Pennock, D. M., Proceedings 7th ACM Conference on Electronic Commerce (EC-2006), Ann Arbor, Michigan, USA, June 11-15, 2006 (2006), ACM), 82-90
[11] Groce, A.; Katz, J., Fair computation with rational players, (Pointcheval, D.; Johansson, T., Advances in Cryptology - EUROCRYPT 2012 - 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings, volume 7237 of Lecture Notes in Computer Science (2012), Springer), 81-98 · Zbl 1290.94150
[12] Halpern, J. Y.; Teague, V., Rational secret sharing and multiparty computation: extended abstract, (Babai, L., Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004 (2004), ACM), 623-632 · Zbl 1192.94119
[13] Hardy, L.; Kent, A., Cheat sensitive quantum bit commitment, Phys. Rev. Lett., 92, 15, 1-4 (2004)
[14] He, G., Security bound of cheat sensitive quantum bit commitment, Sci. Rep., 9398, 5, 1-6 (2015)
[15] Higo, H.; Tanaka, K.; Yasunaga, K., Game-theoretic security for bit commitment, (Sakiyama, K.; Terada, M., Advances in Information and Computer Security - 8th International Workshop on Security, IWSEC 2013, Okinawa, Japan, November 18-20, 2013, Proceedings, volume 8231 of Lecture Notes in Computer Science (2013), Springer), 303-318 · Zbl 1344.94055
[16] Kent, A., Unconditionally secure bit commitment with flying qudits, New J. Phys., 13, 113015, 1-16 (2011)
[17] Li, Y.; Wen, Q.; Li, Z.; Qin, S.; Yang, Y., Cheat sensitive quantum bit commitment via pre- and post-selected quantum states, Quantum Inf. Process., 13, 1, 141-149 (2014) · Zbl 1284.81088
[18] Li, Y.; Xu, S.; Huang, W.; Wan, Z., Quantum bit commitment with cheat sensitive binding and approximate sealing, J. Phys. A: Math. Theor., 48, 135302, 1-10 (2015) · Zbl 1312.81055
[19] Lo, H.-K.; Chau, H. F., Is quantum bit commitment really possible?, Phys. Rev. Lett., 78, 17, 3410-3413 (1997)
[20] Mayers, D., Unconditionally secure quantum bit commitment is impossible, Phys. Rev. Lett., 78, 17, 3414-3417 (1997)
[21] Shimizu, K.; Fukasaka, H.; Tamaki, K.; Imoto, N., Cheat-sensitive commitment of a classical bit coded in a block of m × n round-trip qubits, Phys. Rev. A, 84, 022308, 1-14 (2011)
[22] Yin, Z.; Korzhyk, D.; Kiekintveld, C.; Conitzer, V.; Tambe, M., Stackelberg vs. nash in security games: interchangeability, equivalence, and uniqueness, (van der Hoek, W.; Kaminka, G. A.; Lespérance, Y.; Luck, M.; Sen, S., 9th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2010), Toronto, Canada, May 10-14, 2010, Volume 1-3 (2010), IFAAMAS), 1139-1146 · Zbl 1219.91032
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.