{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T04:34:20Z","timestamp":1773722060923,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:00:00Z","timestamp":1773705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62302496"],"award-info":[{"award-number":["62302496"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172405"],"award-info":[{"award-number":["62172405"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Quantum commitment schemes remain challenging to deploy in practice due to the high cost and fragility of quantum communication. Although recent advances have leveraged quantum channels to improve security and efficiency, these schemes often require substantial quantum interaction, limiting their practicality. To address these challenges, we follow the emerging paradigm of quantum-computation classical-communication (QCCC) protocols, which minimize quantum communication while preserving robust security guarantees. In this work, we construct a QCCC commitment scheme that achieves statistically hiding and computationally collapse-binding-a strong binding notion previously attainable only via collapsing hash functions, which are believed to be stronger than quantum collision-resistant hash functions. In order to circumvent the obstacle of quantum rewinding for an entirely quantum adversary, our construction introduces a novel cryptographic primitive, the quantum inaccessible entropy generator (qIEG), as a quantum analogue of the classical IEG framework developed by Haitner et al. [STOC \u201909]. Notably, our approach relies on potentially weaker assumptions, marking a significant step toward practically deployable and theoretically robust quantum commitments in communication-constrained quantum settings.<\/jats:p>","DOI":"10.1186\/s42400-025-00451-9","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:01:25Z","timestamp":1773716485000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["QCCC commitment from quantum inaccessible entropy generator"],"prefix":"10.1186","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-0472-7691","authenticated-orcid":false,"given":"Kexin","family":"Gao","sequence":"first","affiliation":[]},{"given":"Shujiao","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Tianshu","family":"Shan","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,17]]},"reference":[{"key":"451_CR1","doi-asserted-by":"crossref","unstructured":"Austrin P, Chung H, Chung K,-M, Fu S, Lin Y,-T, Mahmoody M (2022) On the impossibility of key agreements from quantum random oracles. In: Annual International Cryptology Conference, pp. 165\u2013194 .Springer","DOI":"10.1007\/978-3-031-15979-4_6"},{"key":"451_CR2","unstructured":"Ananth P, Lin Y-T, Yuen H(2023) Pseudorandom strings from pseudorandom quantum states. arXiv preprint arXiv:2306.05613"},{"key":"451_CR3","doi-asserted-by":"crossref","unstructured":"Ananth P, Qian L, Yuen H (2022) Cryptography from pseudorandom quantum states. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022. LNCS, vol. 13507, pp. 208\u2013236. Springer.","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"451_CR4","doi-asserted-by":"crossref","unstructured":"Ananth P, Qian L, Yuen H (2022) Cryptography from pseudorandom quantum states. In: Annual International Cryptology Conference, pp. 208\u2013236. Springer","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"451_CR5","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Rosmanis, A., Unruh, D.: Quantum attacks on classical proof systems: The hardness of quantum rewinding. In: 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 474\u2013483 (2014). IEEE","DOI":"10.1109\/FOCS.2014.57"},{"key":"451_CR6","doi-asserted-by":"crossref","unstructured":"Bitansky N, Haitner I, Komargodski I, Yogev E (2019) Distributional collision resistance beyond one-way functions. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 667\u2013695. Springer","DOI":"10.1007\/978-3-030-17659-4_23"},{"key":"451_CR7","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau C, Salvail L, Simard J,-R, Tapp A (2011) Two provers in isolation. In: Advances in Cryptology\u2013ASIACRYPT 2011: 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings 17, pp. 407\u2013430. Springer","DOI":"10.1007\/978-3-642-25385-0_22"},{"key":"451_CR8","doi-asserted-by":"crossref","unstructured":"Ding YZ, Harnik D, Rosen A, Shaltiel R (2004) Constant-round oblivious transfer in the bounded storage model. In: Theory of Cryptography Conference, pp. 446\u2013472 . Springer","DOI":"10.1007\/978-3-540-24638-1_25"},{"key":"451_CR9","doi-asserted-by":"crossref","unstructured":"Dubrov B, Ishai Y (2006) On the randomness complexity of efficient sampling. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, pp. 711\u2013720","DOI":"10.1145\/1132516.1132615"},{"key":"451_CR10","doi-asserted-by":"crossref","unstructured":"Dumais P, Mayers D, Salvail L (2000) Perfectly concealing quantum bit commitment from any quantum one-way permutation. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 300\u2013315. Springer","DOI":"10.1007\/3-540-45539-6_21"},{"key":"451_CR11","unstructured":"Dall\u2019Agnol M, Spooner N (2023) On the necessity of collapsing for post-quantum and quantum commitments"},{"key":"451_CR12","unstructured":"Fang J, Unruh D, Yan J, Zhou D (2020) How to base security on the perfect\/statistical binding property of quantum bit commitment? Cryptology ePrint Archive"},{"key":"451_CR13","doi-asserted-by":"crossref","unstructured":"Haitner I, Horvitz O, Katz J, Koo C,-Y, Morselli R, Shaltiel R (2005) Reducing complexity assumptions for statistically-hiding commitment. In: Advances in Cryptology\u2013EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Aarhus, Denmark, May 22-26, 2005. Proceedings 24, pp. 58\u201377 . Springer","DOI":"10.1007\/11426639_4"},{"issue":"3","key":"451_CR14","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1137\/080725404","volume":"39","author":"I Haitner","year":"2009","unstructured":"Haitner I, Nguyen M-H, Ong SJ, Reingold O, Vadhan S (2009) Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM J Comput 39(3):1153\u20131218","journal-title":"SIAM J Comput"},{"key":"451_CR15","doi-asserted-by":"crossref","unstructured":"Haitner I, Reingold O, Vadhan S, Wee H (2009) Inaccessible entropy. In: Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing, pp. 611\u2013620","DOI":"10.1145\/1536414.1536497"},{"key":"451_CR16","unstructured":"Haitner I, Reingold O, Vadhan S, Wee H (2020) Inaccessible entropy i: Inaccessible entropy generators and statistically hiding commitments from one-way functions. arXiv preprint arXiv:2010.05586"},{"key":"451_CR17","unstructured":"Katz J, Koo C-Y (2005) On constructing universal one-way hash functions from arbitrary one-way functions. Cryptology ePrint Archive"},{"key":"451_CR18","doi-asserted-by":"crossref","unstructured":"Khurana D, Tomer K (2023) Commitments from quantum one-wayness. arXiv preprint arXiv:2310.11526","DOI":"10.1145\/3618260.3649654"},{"key":"451_CR19","doi-asserted-by":"crossref","unstructured":"Komargodski I, Yogev E (2018) On distributional collision resistant hashing. In: Annual International Cryptology Conference, pp. 303\u2013327. Springer","DOI":"10.1007\/978-3-319-96881-0_11"},{"issue":"17","key":"451_CR20","doi-asserted-by":"publisher","first-page":"3410","DOI":"10.1103\/PhysRevLett.78.3410","volume":"78","author":"H-K Lo","year":"1997","unstructured":"Lo H-K, Chau HF (1997) Is quantum bit commitment really possible? Phys Rev Lett 78(17):3410","journal-title":"Phys Rev Lett"},{"issue":"17","key":"451_CR21","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D Mayers","year":"1997","unstructured":"Mayers D (1997) Unconditionally secure quantum bit commitment is impossible. Phys Rev Lett 78(17):3414","journal-title":"Phys Rev Lett"},{"key":"451_CR22","doi-asserted-by":"crossref","unstructured":"Morimae T, Yamakawa T (2022) Quantum commitments and signatures without one-way functions. In: Annual International Cryptology Conference, pp. 269\u2013295. Springer","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"451_CR23","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor M (1991) Bit commitment using pseudorandomness. J Cryptol 4:151\u2013158","journal-title":"J Cryptol"},{"key":"451_CR24","unstructured":"Nielsen MA, Chuang IL (2001) Quantum Computation and Quantum Information vol. 2. Cambridge University Press Cambridge."},{"key":"451_CR25","doi-asserted-by":"crossref","unstructured":"Unruh D (2016) Collapse-binding quantum commitments without random oracles. In: Advances in Cryptology\u2013ASIACRYPT 2016: 22nd International Conference on the Theory and Application of Cryptology and Information Security, Hanoi, Vietnam, December 4-8, 2016, Proceedings, Part II 22, pp. 166\u2013195 . Springer","DOI":"10.1007\/978-3-662-53890-6_6"},{"key":"451_CR26","doi-asserted-by":"crossref","unstructured":"Unruh D (2016) Computationally binding quantum commitments. In: Advances in Cryptology\u2013EUROCRYPT 2016: 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II 35, pp. 497\u2013527. Springer","DOI":"10.1007\/978-3-662-49896-5_18"},{"key":"451_CR27","doi-asserted-by":"crossref","unstructured":"Watrous J (2006) Zero-knowledge against quantum attacks. In: Proceedings of the Thirty-eighth Annual ACM Symposium on Theory of Computing, pp. 296\u2013305","DOI":"10.1145\/1132516.1132560"},{"key":"451_CR28","doi-asserted-by":"crossref","unstructured":"Yan J (2022) General properties of quantum bit commitments. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 628\u2013657. Springer","DOI":"10.1007\/978-3-031-22972-5_22"},{"key":"451_CR29","doi-asserted-by":"crossref","unstructured":"Yan J, Weng J, Lin D, Quan Y (2015) Quantum bit commitment with application in quantum zero-knowledge proof. In: Algorithms and Computation: 26th International Symposium, ISAAC 2015, Nagoya, Japan, December 9-11, 2015, Proceedings 26, pp. 555\u2013565 . Springer","DOI":"10.1007\/978-3-662-48971-0_47"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00451-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-025-00451-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-025-00451-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:01:47Z","timestamp":1773716507000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1186\/s42400-025-00451-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,17]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["451"],"URL":"https:\/\/doi.org\/10.1186\/s42400-025-00451-9","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,17]]},"assertion":[{"value":"9 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"All the authors declare that they have no known Conflict of interest.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"43"}}