A zero-knowledge proof protocol based on quantum teleportation

Yongzhi CHEN; Xincan FAN; Xiaojun WEN

doi:10.3969/j.issn.1007-5461. 2018.02.007

[1] Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proof system[J]. SIAM Journal on Computing, 1989, 18(1): 186-208 (in Chinese).

[2] Brassard G, Crepeau C, et al. Constant-round perfect zero-knowledge computationally convincing protocols[J]. Theoretical Computer Science, 1991, 84(1): 23-52 (in Chinese).

[3] Goldreich O, Kahan A. How to construct constant-round zero-knowledge proof system for NP[J]. J. Cryptology, 1996, 9(3): 167-189 (in Chinese).

[7] Mayers D. Unconditionally secure quantum bit commitment is impossible[J]. Physical Review Letters, 1997, 78(17): 3414-3417.

[8] Lo H K, Chau H F. Is quantum bit commitment really possible [J]. Physical Review Letters, 1997, 78(17): 3410-3413.

[9] Lo H K. Insecurity of quantum secure computation[J]. Physical Review A, 1997, 5(2): 1154-1162.

[10] He G P, Wang Z D. Oblivious transfer using quantum entanglement[J]. Physical Review A, 2006, 73(1): 012331.

[11] Kobayashi H. General properties of quantum zero-knowledge proofs[C]. Proceedings of the 5th Theory of Cryptography Conference, 2008.