{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:10:35Z","timestamp":1760209835560,"version":"build-2065373602"},"reference-count":27,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T00:00:00Z","timestamp":1503532800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptography"],"abstract":"<jats:p>In this paper, we study relativistic bit commitment, which uses timing and location constraints to achieve information theoretic security. Using those constraints, we consider a relativistic bit commitment scheme introduced by Lunghi et al. This protocol was shown secure against classical adversaries as long as the number of rounds performed in the protocol is not too large. In this work, we study classical attacks on this scheme. We use the correspondence between this protocol and the CHSHQ game\u2014which is a variant of the CHSH game\u2014to derive cheating strategies for this protocol. Our attack matches the existing security bound for some range of parameters and shows that the scaling of the security in the number of rounds is essentially optimal.<\/jats:p>","DOI":"10.3390\/cryptography1020014","type":"journal-article","created":{"date-parts":[[2017,8,24]],"date-time":"2017-08-24T11:16:52Z","timestamp":1503573412000},"page":"14","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Recursive Cheating Strategies for the Relativistic FQ Bit Commitment Protocol"],"prefix":"10.3390","volume":"1","author":[{"given":"R\u00e9mi","family":"Bricout","sequence":"first","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure, 45 Rue d\u2019Ulm, 75005 Paris, France"}]},{"given":"Andr\u00e9","family":"Chailloux","sequence":"additional","affiliation":[{"name":"\u00c9cole Normale Sup\u00e9rieure, 45 Rue d\u2019Ulm, 75005 Paris, France"},{"name":"Secret Project Team, Inria de Paris, 2 rue Simone Iff, 75018 Paris, France"}]}],"member":"1968","published-online":{"date-parts":[[2017,8,24]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","article-title":"A Method for Obtaining Digital Signatures and Public-key Cryptosystems","volume":"21","author":"Rivest","year":"1978","journal-title":"Commun. ACM"},{"key":"ref_2","unstructured":"Bennett, C.H., and Brassard, G. (1984, January 9\u201312). Quantum cryptography: Public key distribution and coin tossing. Proceedings of the IEEE International Conference on Computer Systems and Signal Processing, Bangalore, India."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1038\/nphoton.2014.327","article-title":"Provably secure and practical quantum key distribution over 307 km of optical fibre","volume":"9","author":"Korzh","year":"2015","journal-title":"Nat. Photonics"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1103\/PhysRevLett.83.1447","article-title":"Unconditionally Secure Bit Commitment","volume":"83","author":"Kent","year":"1999","journal-title":"Phys. Rev. Lett."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Kilian, J., and Wigderson, A. (1988, January 2\u20134). Multi-prover interactive proofs: How to remove intractability assumptions. Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, Chicago, IL, USA.","DOI":"10.1145\/62212.62223"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","article-title":"Unconditionally Secure Quantum Bit Commitment is Impossible","volume":"78","author":"Mayers","year":"1997","journal-title":"Phys. Rev. Lett."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","article-title":"Is Quantum Bit Commitment Really Possible?","volume":"78","author":"Lo","year":"1997","journal-title":"Phys. Rev. Lett."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s00145-005-0905-8","article-title":"Secure Classical Bit Commitment Using Fixed Capacity Communication Channels","volume":"18","author":"Kent","year":"2005","journal-title":"J. Cryptol."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"113015","DOI":"10.1088\/1367-2630\/13\/11\/113015","article-title":"Unconditionally secure bit commitment with flying qudits","volume":"13","author":"Kent","year":"2011","journal-title":"New J. Phys."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"130501","DOI":"10.1103\/PhysRevLett.109.130501","article-title":"Unconditionally Secure Bit Commitment by Transmitting Measurement Outcomes","volume":"109","author":"Kent","year":"2012","journal-title":"Phys. Rev. Lett."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"4687","DOI":"10.1109\/TIT.2013.2247463","article-title":"Secure bit commitment from relativistic constraints","volume":"59","author":"Kaniewski","year":"2013","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"180504","DOI":"10.1103\/PhysRevLett.111.180504","article-title":"Experimental Bit Commitment Based on Quantum Communication and Special Relativity","volume":"111","author":"Lunghi","year":"2013","journal-title":"Phys. Rev. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"012326","DOI":"10.1103\/PhysRevA.84.012326","article-title":"Quantum tagging: Authenticating location via quantum information and relativistic signaling constraints","volume":"84","author":"Kent","year":"2011","journal-title":"Phys. Rev. A"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"012322","DOI":"10.1103\/PhysRevA.83.012322","article-title":"Insecurity of position-based quantum-cryptography protocols against entanglement attacks","volume":"83","author":"Lau","year":"2011","journal-title":"Phys. Rev. A"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Unruh, D. (2014). Quantum position verification in the random oracle model. Advances in Cryptology\u2014CRYPTO 2014, Springer.","DOI":"10.1007\/978-3-662-44381-1_1"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Chandran, N., Goyal, V., Moriarty, R., and Ostrovsky, R. (2009). Position based cryptography. Advances in Cryptology\u2014CRYPTO 2009, Springer.","DOI":"10.1007\/978-3-642-03356-8_23"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1137\/130913687","article-title":"Position-based quantum cryptography: Impossibility and constructions","volume":"43","author":"Buhrman","year":"2014","journal-title":"SIAM J. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Salvail, L., Simard, J.R., and Tapp, A. (2011). Two provers in isolation. Advances in Cryptology\u2014ASIACRYPT 2011, Springer.","DOI":"10.1007\/978-3-642-25385-0_22"},{"key":"ref_19","unstructured":"Simard, J.R. (2007). Classical and Quantum Strategies for Bit Commitment Schemes in the Two-Prover Model. [Master\u2019s Thesis, McGill University]."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"030502","DOI":"10.1103\/PhysRevLett.115.030502","article-title":"Practical Relativistic Bit Commitment","volume":"115","author":"Lunghi","year":"2015","journal-title":"Phys. Rev. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"250501","DOI":"10.1103\/PhysRevLett.115.250501","article-title":"Arbitrarily Long Relativistic Bit Commitment","volume":"115","author":"Chakraborty","year":"2015","journal-title":"Phys. Rev. Lett."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Fehr, S., and Fillinger, M. On the Composition of Two-Prover Commitments, and Applications to Multi-round Relativistic Commitments. Advances in Cryptology\u2014EUROCRYPT 2016, Proceedings of the 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, 8\u201312 May 2016.","DOI":"10.1007\/978-3-662-49896-5_17"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Verbanis, E., Martin, A., Houlmann, R., Boso, G., Bussi\u00e8res, F., and Zbinden, H. (arXiv, 2016). 24-Hour Relativistic Bit Commitment, arXiv.","DOI":"10.1103\/PhysRevLett.117.140506"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Bavarian, M., and Shor, P.W. (2015, January 11\u201313). Information Causality, Szemer\u00e9di-Trotter and Algebraic Variants of CHSH. Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS 2015, Rehovot, Israel.","DOI":"10.1145\/2688073.2688112"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"025013","DOI":"10.1088\/1367-2630\/18\/2\/025013","article-title":"An explicit classical strategy for winning a CHSHq game","volume":"18","author":"Pivoluska","year":"2016","journal-title":"New J. Phys."},{"key":"ref_26","unstructured":"Pivoluska, M., Pawlowski, M., and Plesch, M. (arXiv, 2016). Experimentally Secure Relativistic Bit Commitment, arXiv."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"052103","DOI":"10.1103\/PhysRevA.72.052103","article-title":"Causality and Tsirelson\u2019s bounds","volume":"72","author":"Buhrman","year":"2005","journal-title":"Phys. Rev. A"}],"container-title":["Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2410-387X\/1\/2\/14\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T18:43:14Z","timestamp":1760208194000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2410-387X\/1\/2\/14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,24]]},"references-count":27,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2017,9]]}},"alternative-id":["cryptography1020014"],"URL":"https:\/\/doi.org\/10.3390\/cryptography1020014","relation":{},"ISSN":["2410-387X"],"issn-type":[{"type":"electronic","value":"2410-387X"}],"subject":[],"published":{"date-parts":[[2017,8,24]]}}}