{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T15:55:21Z","timestamp":1766159721303,"version":"3.41.0"},"reference-count":45,"publisher":"Verein zur Forderung des Open Access Publizierens in den Quantenwissenschaften","license":[{"start":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T00:00:00Z","timestamp":1750723200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"National Research Foundation, Singapore and A*STAR","award":["NRF2021-QEP2-01-P06"],"award-info":[{"award-number":["NRF2021-QEP2-01-P06"]}]},{"name":"CCI SWVA Cyber Innovation Scholars Program","award":["556118"],"award-info":[{"award-number":["556118"]}]}],"content-domain":{"domain":["quantum-journal.org"],"crossmark-restriction":false},"short-container-title":["Quantum"],"abstract":"Weak coin flipping is a cryptographic primitive in which two mutually distrustful parties generate a shared random bit to agree on a winner via remote communication. While a stand-alone secure weak coin flipping protocol can be constructed from noiseless quantum communication channels, its composability remains unexplored. In this work, we demonstrate that no weak coin flipping protocol can be abstracted as a simple black-box resource with composable security. Despite this, we also establish the overall stand-alone security of quantum weak coin flipping protocols under composition in sequential order.<\/jats:p>","DOI":"10.22331\/q-2025-06-24-1780","type":"journal-article","created":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T12:20:31Z","timestamp":1750767631000},"page":"1780","update-policy":"https:\/\/doi.org\/10.22331\/q-crossmark-policy-page","source":"Crossref","is-referenced-by-count":1,"title":["On the composable security of weak coin flipping"],"prefix":"10.22331","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7340-7846","authenticated-orcid":false,"given":"Jiawei","family":"Wu","sequence":"first","affiliation":[{"name":"Centre for Quantum Technologies, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-1105-589X","authenticated-orcid":false,"given":"Yanglin","family":"Hu","sequence":"additional","affiliation":[{"name":"Centre for Quantum Technologies, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akshay","family":"Bansal","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA"},{"name":"Virginia Tech Center for Quantum Information Science and Engineering, Blacksburg, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5410-3329","authenticated-orcid":false,"given":"Marco","family":"Tomamichel","sequence":"additional","affiliation":[{"name":"Centre for Quantum Technologies, National University of Singapore, Singapore"},{"name":"Department of Electrical and Computer Engineering, National University of Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"9598","published-online":{"date-parts":[[2025,6,24]]},"reference":[{"key":"0","doi-asserted-by":"publisher","unstructured":"Robert K\u00f6nig, Renato Renner, Andor Bariska, and Ueli Maurer. ``Small accessible quantum information does not imply security''. Physical Review Letters 98, 140502 (2007).","DOI":"10.1103\/PhysRevLett.98.140502"},{"key":"1","doi-asserted-by":"publisher","unstructured":"David P. DiVincenzo, Micha\u0142 Horodecki, Debbie W. Leung, John A. Smolin, and Barbara M. Terhal. ``Locking classical correlations in quantum states''. Physical Review Letters 92, 067902 (2004).","DOI":"10.1103\/PhysRevLett.92.067902"},{"key":"2","doi-asserted-by":"publisher","unstructured":"Ran Canetti. ``Security and Composition of Multiparty Cryptographic Protocols''. Journal of Cryptology 13, 143\u2013202 (2000).","DOI":"10.1007\/s001459910006"},{"key":"3","doi-asserted-by":"publisher","unstructured":"Ran Canetti. ``Universally composable security: A new paradigm for cryptographic protocols''. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science. Pages 136\u2013145. (2001).","DOI":"10.1109\/SFCS.2001.959888"},{"key":"4","doi-asserted-by":"publisher","unstructured":"Ran Canetti, Yevgeniy Dodis, Rafael Pass, and Shabsi Walfish. ``Universally composable security with global setup''. In Theory of Cryptography. Pages 61\u201385. Springer Berlin Heidelberg (2007).","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"5","doi-asserted-by":"publisher","unstructured":"Dominique Unruh. ``Universally composable quantum multi-party computation''. In Advances in Cryptology \u2013 EUROCRYPT 2010. Pages 486\u2013505. Springer Berlin Heidelberg (2010).","DOI":"10.1007\/978-3-642-13190-5_25"},{"key":"6","doi-asserted-by":"publisher","unstructured":"Ran Canetti and Jonathan Herzog. ``Universally composable symbolic security analysis''. Journal of Cryptology 24, 83\u2013147 (2011).","DOI":"10.1007\/s00145-009-9055-0"},{"key":"7","doi-asserted-by":"publisher","unstructured":"Ran Canetti, Asaf Cohen, and Yehuda Lindell. ``A simpler variant of universally composable security for standard multiparty computation''. In Advances in Cryptology \u2013 CRYPTO 2015. Pages 3\u201322. Springer Berlin Heidelberg (2015).","DOI":"10.1007\/978-3-662-48000-7_1"},{"key":"8","unstructured":"Ueli Maurer and Renato Renner. ``Abstract cryptography''. In The Second Symposium on Innovations in Computer Science, ICS 2011. Pages 1\u201321. Tsinghua University Press (2011). url: https:\/\/crypto.ethz.ch\/publications\/files\/MauRen11.pdf."},{"key":"9","doi-asserted-by":"publisher","unstructured":"Ueli Maurer. ``Constructive Cryptography \u2013 A New Paradigm for Security Definitions and Proofs''. In Theory of Security and Applications. Pages 33\u201356. Lecture Notes in Computer Science. Springer (2012).","DOI":"10.1007\/978-3-642-27375-9_3"},{"key":"10","doi-asserted-by":"publisher","unstructured":"Hoi-Kwong Lo. ``Insecurity of quantum secure computations''. Physical Review A 56, 1154\u20131162 (1997).","DOI":"10.1103\/PhysRevA.56.1154"},{"key":"11","doi-asserted-by":"publisher","unstructured":"Hoi-Kwong Lo and H. F. Chau. ``Is quantum bit commitment really possible?''. Physical Review Letters 78, 3410\u20133413 (1997).","DOI":"10.1103\/PhysRevLett.78.3410"},{"key":"12","doi-asserted-by":"publisher","unstructured":"Dominic Mayers. ``Unconditionally Secure Quantum Bit Commitment is Impossible''. Physical Review Letters 78, 3414\u20133417 (1997).","DOI":"10.1103\/PhysRevLett.78.3414"},{"key":"13","doi-asserted-by":"publisher","unstructured":"Hoi-Kwong Lo and H.F. Chau. ``Why quantum bit commitment and ideal quantum coin tossing are impossible''. Physica D: Nonlinear Phenomena 120, 177\u2013187 (1998).","DOI":"10.1016\/S0167-2789(98)00053-0"},{"key":"14","doi-asserted-by":"publisher","unstructured":"Andris Ambainis, Harry Buhrman, Yevgeniy Dodis, and Hein Rohrig. ``Multiparty quantum coin flipping''. In Proceedings of the 19th Annual IEEE Conference on Computational Complexity. Pages 250\u2013259. (2004).","DOI":"10.1109\/CCC.2004.1313848"},{"key":"15","doi-asserted-by":"publisher","unstructured":"Carlos Mochon. ``Quantum weak coin flipping with arbitrarily small bias'' (2007). arXiv:0711.4114.","DOI":"10.48550\/arXiv.0711.4114"},{"key":"16","doi-asserted-by":"publisher","unstructured":"Atul Singh Arora, J\u00e9r\u00e9mie Roland, and Stephan Weis. ``Quantum weak coin flipping''. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Pages 205\u2013216. (2019).","DOI":"10.1145\/3313276.3316306"},{"key":"17","doi-asserted-by":"publisher","unstructured":"Atul Singh Arora, J\u00e9r\u00e9mie Roland, and Chrysoula Vlachou. ``Analytic quantum weak coin flipping protocols with arbitrarily small bias''. In Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA). Pages 919\u2013938. (2021).","DOI":"10.1137\/1.9781611976465.58"},{"key":"18","unstructured":"Atul Singh Arora, J\u00e9r\u00e9mie Roland, Chrysoula Vlachou, and Stephan Weis. ``Solutions to quantum weak coin flipping''. Cryptology ePrint Archive, Paper 2022\/1101 (2022)."},{"key":"19","doi-asserted-by":"publisher","unstructured":"Daniel J Bernstein, Johannes Buchmann, and Erik Dahmen. ``Post-Quantum Cryptography''. Springer Berlin Heidelberg. (2008).","DOI":"10.1007\/978-3-540-88702-7"},{"key":"20","doi-asserted-by":"publisher","unstructured":"Ivan Damg\u00e5rd and Carolin Lunemann. ``Quantum-secure coin-flipping and applications''. In Advances in Cryptology \u2013 ASIACRYPT 2009. Pages 52\u201369. Springer Berlin Heidelberg (2009).","DOI":"10.1007\/978-3-642-10366-7_4"},{"key":"21","doi-asserted-by":"publisher","unstructured":"Urmila Mahadev. ``Classical homomorphic encryption for quantum circuits''. In Proceedings of the 59th Annual Symposium on Foundations of Computer Science. Pages 332\u2013338. (2018).","DOI":"10.1109\/FOCS.2018.00039"},{"key":"22","doi-asserted-by":"publisher","unstructured":"Ivan B. Damg\u00e5rd, Serge Fehr, Louis Salvail, and Christian Schaffner. ``Cryptography in the bounded-quantum-storage model''. SIAM Journal on Computing 37, 1865\u20131890 (2008).","DOI":"10.1137\/060651343"},{"key":"23","doi-asserted-by":"publisher","unstructured":"Stephanie Wehner and J\u00fcrg Wullschleger. ``Composable Security in the Bounded-Quantum-Storage Model''. In Automata, Languages and Programming. Pages 604\u2013615. Lecture Notes in Computer Science. Springer (2008).","DOI":"10.1007\/978-3-540-70583-3_49"},{"key":"24","doi-asserted-by":"publisher","unstructured":"Dominique Unruh. ``Concurrent composition in the bounded quantum storage model''. In Advances in Cryptology \u2013 EUROCRYPT 2011. Pages 467\u2013486. Springer Berlin Heidelberg (2011).","DOI":"10.1007\/978-3-642-20465-4_26"},{"key":"25","unstructured":"Dan Boneh and Victor Shoup. ``A Graduate Course in Applied Cryptography''. Online. (2023). url: https:\/\/toc.cryptobook.us\/."},{"key":"26","doi-asserted-by":"publisher","unstructured":"David Nowak. ``A framework for game-based security proofs''. In Information and Communications Security. Pages 319\u2013333. Springer Berlin Heidelberg (2007).","DOI":"10.1007\/978-3-540-77048-0_25"},{"key":"27","doi-asserted-by":"publisher","unstructured":"Andr\u00e9 Chailloux and Iordanis Kerenidis. ``Optimal Bounds for Quantum Bit Commitment''. In Proceedings of the 52nd Annual IEEE Symposium on Foundations of Computer Science. Pages 354\u2013362. (2011).","DOI":"10.1109\/FOCS.2011.42"},{"key":"28","doi-asserted-by":"publisher","unstructured":"Andr\u00e9 Chailloux and Iordanis Kerenidis. ``Optimal Quantum Strong Coin Flipping''. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science. Pages 527\u2013533. (2009).","DOI":"10.1109\/FOCS.2009.71"},{"key":"29","doi-asserted-by":"publisher","unstructured":"Gr\u00e9gory Demay and Ueli Maurer. ``Unfair coin tossing''. In Proceedings of the IEEE International Symposium on Information Theory. Pages 1556\u20131560. (2013).","DOI":"10.1109\/ISIT.2013.6620488"},{"key":"30","doi-asserted-by":"publisher","unstructured":"V Vilasini, Christopher Portmann, and L\u00eddia del Rio. ``Composable security in relativistic quantum cryptography''. New Journal of Physics 21, 043057 (2019).","DOI":"10.1088\/1367-2630\/ab0e3b"},{"key":"31","doi-asserted-by":"publisher","unstructured":"Carl A. Miller. ``The impossibility of efficient Quantum weak coin flipping''. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Pages 916\u2013929. (2020).","DOI":"10.1145\/3357713.3384276"},{"key":"32","doi-asserted-by":"publisher","unstructured":"Oded Goldreich. ``Foundations of Cryptography''. Volume 2. Cambridge University Press. (2004).","DOI":"10.1017\/CBO9780511721656"},{"key":"33","doi-asserted-by":"publisher","unstructured":"Silvio Micali and Phillip Rogaway. ``Secure Computation''. In Advances in Cryptology \u2014 CRYPTO '91. Pages 392\u2013404. Springer Berlin Heidelberg (1992).","DOI":"10.1007\/3-540-46766-1_32"},{"key":"34","doi-asserted-by":"publisher","unstructured":"Donald Beaver. ``Foundations of Secure Interactive Computing''. In Advances in Cryptology \u2014 CRYPTO '91. Pages 377\u2013391. Springer Berlin Heidelberg (1992).","DOI":"10.1007\/3-540-46766-1_31"},{"key":"35","doi-asserted-by":"publisher","unstructured":"Christopher Portmann, Christian Matt, Ueli Maurer, Renato Renner, and Bj\u00f6rn Tackmann. ``Causal Boxes: Quantum Information-Processing Systems Closed Under Composition''. IEEE Transactions on Information Theory 63, 3277\u20133305 (2017).","DOI":"10.1109\/TIT.2017.2676805"},{"key":"36","doi-asserted-by":"publisher","unstructured":"J\u0119drzej Kaniewski, Marco Tomamichel, Esther H\u00e4nggi, and Stephanie Wehner. ``Secure bit commitment from relativistic constraints''. IEEE Transactions on Information Theory 59, 4687\u20134699 (2013).","DOI":"10.1109\/TIT.2013.2247463"},{"key":"37","doi-asserted-by":"publisher","unstructured":"Rishabh Batra, Sayantan Chakraborty, Rahul Jain, and Upendra Kapshikar. ``Robust and composable device-independent quantum protocols for oblivious transfer and bit commitment'' (2024). arXiv:2404.11283.","DOI":"10.48550\/arXiv.2404.11283"},{"key":"38","doi-asserted-by":"publisher","unstructured":"Yehuda Lindell. ``How to simulate it \u2013 a tutorial on the simulation proof technique''. Pages 277\u2013346. Springer International Publishing. (2017).","DOI":"10.1007\/978-3-319-57048-8_6"},{"key":"39","doi-asserted-by":"publisher","unstructured":"Gus Gutoski and John Watrous. ``Toward a general theory of quantum games''. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing. Pages 565\u2013574. (2007).","DOI":"10.1145\/1250790.1250873"},{"key":"40","doi-asserted-by":"publisher","unstructured":"Giulio Chiribella, Giacomo Mauro D'Ariano, and Paolo Perinotti. ``Theoretical framework for quantum networks''. Physical Review A 80, 022339 (2009).","DOI":"10.1103\/PhysRevA.80.022339"},{"key":"41","doi-asserted-by":"publisher","unstructured":"Manuel Blum. ``Coin flipping by telephone a protocol for solving impossible problems''. SIGACT News 15, 23\u201327 (1983).","DOI":"10.1145\/1008908.1008911"},{"key":"42","doi-asserted-by":"publisher","unstructured":"Vedran Dunjko, Joseph F. Fitzsimons, Christopher Portmann, and Renato Renner. ``Composable Security of Delegated Quantum Computation''. In Advances in Cryptology \u2013 ASIACRYPT 2014. Pages 406\u2013425. Springer Berlin Heidelberg (2014).","DOI":"10.1007\/978-3-662-45608-8_22"},{"key":"43","doi-asserted-by":"publisher","unstructured":"Anne Broadbent, Joseph Fitzsimons, and Elham Kashefi. ``Universal Blind Quantum Computation''. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science. Pages 517\u2013526. (2009).","DOI":"10.1109\/FOCS.2009.36"},{"key":"44","doi-asserted-by":"publisher","unstructured":"Joseph F. Fitzsimons. ``Private quantum computation: An introduction to blind quantum computing and related protocols''. npj Quantum Information 3, 1\u201311 (2017).","DOI":"10.1038\/s41534-017-0025-3"}],"container-title":["Quantum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-06-24-1780\/pdf\/","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T12:20:32Z","timestamp":1750767632000},"score":1,"resource":{"primary":{"URL":"https:\/\/quantum-journal.org\/papers\/q-2025-06-24-1780\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,24]]},"references-count":45,"URL":"https:\/\/doi.org\/10.22331\/q-2025-06-24-1780","archive":["CLOCKSS"],"relation":{},"ISSN":["2521-327X"],"issn-type":[{"value":"2521-327X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,24]]},"article-number":"1780"}}