Quantum Bit Commitment with Application in Quantum Zero-Knowledge Proof (Extended Abstract)

Watrous (STOC 2006) proved that plugging classical bit commitment scheme that is secure against quantum attack into the GMW-type construction of zero-knowledge gives a classical zero-knowledge proof that is secure against quantum attack. In this paper, we showed that plugging quantum bit commitment scheme (allowing quantum computation and communication) into the GMW-type construction also gives a quantum zero-knowledge proof, as one expects. However, since the binding condition of quantum bit commitment scheme is inherently different from its classical counterpart, compared with Watrous’ security proof, here we encounter new difficulty in soundness analysis. To overcome the difficulty, we take a g eometric approach, managing to reduce quantum soundness analysis to classical soundness analysis. We also propose a formalization of non-interactive quantum bit commitment scheme, which may come in handy in other places. Moreover, inspired by our formalization, we generalize Naor’s construction of bit commitment scheme to the quantum setting, achieving non-interactive commit stage. We hope quantum bit commitment scheme can find more applications in quantum cryptography.

[1]  J. Watrous.  Zero-knowledge against quantum attacks (Preliminary version) , 2005 .

[2]  Takeshi Koshiba,et al.  Non-Interactive Statistically-Hiding Quantum Bit Commitment from Any Quantum One-Way Function , 2011, 1102.3441.

[3]  SahaiAmit,et al.  A complete problem for statistical zero knowledge , 2003 .

[4]  Ashwin Nayak,et al.  Bit-commitment-based quantum coin flipping , 2002, quant-ph/0206123.

[5]  Louis Salvail,et al.  Computational Collapse of Quantum State with Application to Oblivious Transfer , 2003, TCC.

[6]  Jeroen van de Graaf,et al.  Towards a formal definition of security for quantum protocols , 1998 .

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

[8]  Salil P. Vadhan,et al.  An unconditional study of computational zero knowledge , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[9]  John Watrous,et al.  Limits on the power of quantum statistical zero-knowledge , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[10]  Jun Yan,et al.  Complete Problem for Perfect Zero-Knowledge Quantum Proof , 2012, SOFSEM.

[11]  Adam D. Smith,et al.  Classical Cryptographic Protocols in a Quantum World , 2011, IACR Cryptol. ePrint Arch..

[12]  Iordanis Kerenidis,et al.  Optimal Bounds for Quantum Bit Commitment , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

[13]  Moni Naor,et al.  Bit commitment using pseudorandomness , 1989, Journal of Cryptology.

[14]  Salil P. Vadhan,et al.  An Equivalence Between Zero Knowledge and Commitments , 2008, TCC.

[15]  Hirotada Kobayashi,et al.  Non-interactive Quantum Perfect and Statistical Zero-Knowledge , 2003, ISAAC.

[16]  Oded Goldreich.  Foundations of Cryptography: Index , 2001 .

[17]  Hirotada Kobayashi,et al.  General Properties of Quantum Zero-Knowledge Proofs , 2007, TCC.

[18]  Oded Goldreich,et al.  Foundations of Cryptography: Basic Tools , 2000 .

[19]  Salil P. Vadhan,et al.  Zero Knowledge and Soundness Are Symmetric , 2007, EUROCRYPT.

[20]  Manuel Blum,et al.  How to Prove a Theorem So No One Else Can Claim It , 2010 .

[21]  Richard Cleve,et al.  A Quantum Goldreich-Levin Theorem with Cryptographic Applications , 2002, STACS.

[22]  Dominique Unruh,et al.  Quantum Proofs of Knowledge , 2012, IACR Cryptol. ePrint Arch..

[23]  Oded Goldreich,et al.  Foundations of Cryptography: List of Figures , 2001 .

[24]  Takeshi Koshiba,et al.  Statistically-Hiding Quantum Bit Commitment from Approximable-Preimage-Size Quantum One-Way Function , 2009, TCQ.

[25]  Leonid A. Levin,et al.  A Pseudorandom Generator from any One-way Function , 1999, SIAM J. Comput..

[26]  Omer Reingold,et al.  Finding Collisions in Interactive Protocols - A Tight Lower Bound on the Round Complexity of Statistically-Hiding Commitments , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[27]  John Watrous.  Zero-Knowledge against Quantum Attacks , 2009, SIAM J. Comput..

[28]  Silvio Micali,et al.  Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems , 1991, JACM.

[29]  Iordanis Kerenidis,et al.  Quantum commitments from complexity assumptions , 2010, computational complexity.

[30]  Louis Salvail,et al.  Perfectly Concealing Quantum Bit Commitment from any Quantum One-Way Permutation , 2000, EUROCRYPT.

[31]  Daniele Micciancio,et al.  Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More , 2003, CRYPTO.

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

[33]  Andris Ambainis,et al.  Quantum Attacks on Classical Proof Systems: The Hardness of Quantum Rewinding , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[34]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .