Abstract
We revisit the Two-Prover Bit Commitment Scheme of BenOr, Goldwasser, Kilian and Wigderson [BGKW88]. First, we introduce Two-Prover Bit Commitment Schemes similar to theirs and demonstrate that although they are classically secure using their proof technique, we also show that if the provers are allowed to share quantum entanglement, they are able to successfully break the binding condition. Secondly, we translate this result in a purely classical setting and investigate the possibility of using this Bit Commitment scheme in applications. We observe that the security claim of [BGKW88] based on the assumption that the provers cannot communicate is not a sufficient criteria to obtain soundness. We develop a set of conditions, called isolation, that must be satisfied by any third party interacting with the provers to guarantee the binding property of the Bit Commitment.
An earlier version of this work was presented under the title “Classical and Quantum Strategies for Two-Prover Bit Commitments”, at QIP ’06, The 9th Workshop on Quantum Information Processing, January 16-20, 2006, Paris.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aravind, P.K.: Bell’s theorem without inequalities and only two distant observers. Foundation of Physics Letters, 397–405 (2002)
Brassard, G., Crépeau, C., Mayers, D., Salvail, L.: Defeating classical bit commitment schemes with a quantum computer. ArXiv Quantum Physics e-prints (1998)
Buhrman, H., Christandl, M., Unger, F., Wehner, S., Winter, A.: Implications of superstrong nonlocality for cryptography. Proceedings of The Royal Society A 462(2071), 1919–1932 (2006)
Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Computational Complexity 1, 3–40 (1991)
BenOr, M., Goldwasser, S., Kilian, J., Widgerson, A.: Multi-prover interactive proofs: how to remove intractability. In: STOC 1988: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 113–131. ACM Press, New York (1988)
Ben-Or, M., Hassidim, A., Pilpel, H.: Quantum Multi Prover Interactive Proofs with Communicating Provers. In: 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 467–476. IEEE Computer Society (2008)
Cleve, R., Hoyer, P., Toner, B., Watrous, J.: Consequences and limits of nonlocal strategies. In: CCC 2004: Proceedings of the 19th IEEE Annual Conference on Computational Complexity, pp. 236–249. IEEE Computer Society, Washington, DC, USA (2004)
Crépeau, C., Légaré, F., Salvail, L.: How to Convert the Flavor of a Quantum Bit Commitment. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 60–77. Springer, Heidelberg (2001)
Cleve, R., Slofstra, W., Unger, F., Upadhyay, S.: Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. In: CCC 2007: Proceedings of the 2007 IEEE 22nd Annual Conference on Computational Complexity, pp. 109–114. IEEE Computer Society, Los Alamitos (2007)
Damgård, I., Fehr, S., Salvail, L., Schaffner, C.: Cryptography in the bounded quantum-storage model. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 449–458. IEEE Computer Society (2005)
Damgård, I., Fehr, S., Renner, R., Salvail, L., Schaffner, C.: A Tight High-Order Entropic Quantum Uncertainty Relation with Applications. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 360–378. Springer, Heidelberg (2007)
Doherty, A.C., Liang, Y.-C., Toner, B., Wehner, S.: The Quantum Moment Problem and Bounds on Entangled Multi-prover Games. In: CCC 2008: Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity, pp. 199–210. IEEE Computer Society, Washington, DC, USA (2008)
Dumais, P., Mayers, D., Salvail, L.: Perfectly concealing quantum bit commitment from any quantum one-way permutation, pp. 300–315 (2000)
Ito, T., Kobayashi, H., Matsumoto, K.: Oracularization and Two-Prover One-Round Interactive Proofs against Nonlocal Strategies. In: CCC 2009: Proceedings of the 2009 IEEE 24th Annual Conference on Computational Complexity, pp. 217–228. IEEE Computer Society, Los Alamitos (2009)
Ibaraki, T., Katoh, N., Ono, H. (eds.): ISAAC 2003. LNCS, vol. 2906. Springer, Heidelberg (2003)
Ito, T., Kobayashi, H., Preda, D., Sun, X., Yao, A.C.-C.: Generalized Tsirelson Inequalities, Commuting-Operator Provers, and Multi-prover Interactive Proof Systems. In: CCC 2008: Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity, pp. 187–198. IEEE Computer Society, Washington, DC, USA (2008)
Kent, A.: Secure classical bit commitment using fixed capacity communication channels. J. Cryptology 18(4), 313–335 (2005)
Kilian, J.: Founding cryptography on oblivious transfer. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pp. 20–31 (1988)
Kempe, J., Kobayashi, H., Matsumoto, K., Vidick, T.: Using Entanglement in Quantum Multi-prover Interactive Proofs. In: CCC 2008: Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity, pp. 211–222. IEEE Computer Society, Washington, DC, USA (2008)
Kobayashi, H., Matsumoto, K.: Quantum multi-prover interactive proof systems with limited prior entanglement. J. Comput. Syst. Sci. 66(3), 429–450 (2003)
Kobayashi, H., Matsumoto, K., Yamakami, T.: Quantum merlin-arthur proof systems: Are multiple merlins more helpful to arthur? In: Ibaraki, et al. (eds.) [IKO03], pp. 189–198 (2003)
Lo, H.-K., Chau, H.F.: Is quantum bit commitment really possible? Phys. Rev. Lett. 78(17), 3410–3413 (1997)
Lapidot, D., Shamir, A.: Fully parallelized multi-prover protocols for nexp-time. J. Comput. Syst. Sci. 54(2), 215–220 (1997)
Mayers, D.: Unconditionally secure quantum bit commitment is impossible (November 1996)
Popescu, S., Rohrlich, D.: Nonlocality as an axiom. Foundations of Physics 24, 379 (1994)
Popescu, S., Rohrlich, D.: Causality and nonlocality as axioms for quantum mechanics. In: Symposium on Causality and Locality in Modern Physics and Astronomy (1997)
Wehner, S.: Entanglement in Interactive Proof Systems with Binary Answers. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol. 3884, pp. 162–171. Springer, Heidelberg (2006)
Yao, A.C.-C.: Interactive proofs for quantum computation. In: Ibaraki, et al. (eds.) [IKO03], p. 1 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 International Association for Cryptologic Research
About this paper
Cite this paper
Crépeau, C., Salvail, L., Simard, JR., Tapp, A. (2011). Two Provers in Isolation. In: Lee, D.H., Wang, X. (eds) Advances in Cryptology – ASIACRYPT 2011. ASIACRYPT 2011. Lecture Notes in Computer Science, vol 7073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25385-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-25385-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25384-3
Online ISBN: 978-3-642-25385-0
eBook Packages: Computer ScienceComputer Science (R0)