{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:59:43Z","timestamp":1773269983156,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":36,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819562022","type":"print"},{"value":"9789819562039","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-6203-9_1","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:29:34Z","timestamp":1767320974000},"page":"3-22","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantum-Computation Classical-Communication Commitments from\u00a0SZK-Hardness"],"prefix":"10.1007","author":[{"given":"Kexin","family":"Gao","sequence":"first","affiliation":[]},{"given":"Shujiao","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Xue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"1_CR1","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. IEEE (2014)","DOI":"10.1109\/FOCS.2014.57"},{"key":"1_CR2","unstructured":"Ananth, P., Lin, Y.-T., Yuen, H.: Pseudorandom strings from pseudorandom quantum states. arXiv preprint arXiv:2306.05613 (2023)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ananth, P., Qian, L., Yuen, H.: Cryptography from pseudorandom quantum states. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I, vol. 13507. LNCS, pp. 208\u2013236. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Austrin, P., Chung, H., Chung, K.-M., Fu, S., Lin, Y.-T., Mahmoody, M.: On the impossibility of key agreements from quantum random oracles. In: Annual International Cryptology Conference, pp. 165\u2013194. Springer (2022)","DOI":"10.1007\/978-3-031-15979-4_6"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Haitner, I., Komargodski, I., Yogev, E.: Distributional collision resistance beyond one-way functions. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 667\u2013695. Springer (2019)","DOI":"10.1007\/978-3-030-17659-4_23"},{"issue":"5","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3441309","volume":"68","author":"Z Brakerski","year":"2021","unstructured":"Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U., Vidick, T.: A cryptographic test of quantumness and certifiable randomness from a single quantum device. Journal of the ACM (JACM) 68(5), 1\u201347 (2021)","journal-title":"Journal of the ACM (JACM)"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0022-0000(88)90005-0","volume":"37","author":"G Brassard","year":"1988","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum disclosure proofs of knowledge. J. Comput. Syst. Sci. 37(2), 156\u2013189 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Canetti, R., Feige, U., Goldreich, O., Naor, M.: Adaptively secure multi-party computation. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, pp. 639\u2013648 (1996)","DOI":"10.1145\/237814.238015"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Cr\u00e9peau, C., Salvail, L., Simard, J.-R., Tapp, A.: Two provers in isolation. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 407\u2013430. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25385-0_22","DOI":"10.1007\/978-3-642-25385-0_22"},{"key":"1_CR10","unstructured":"Dall\u2019Agnol, M., Spooner, N.: On the necessity of collapsing for post-quantum and quantum commitments (2023)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Dumais, P., Mayers, D., Salvail, L.: 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 (2000)","DOI":"10.1007\/3-540-45539-6_21"},{"issue":"3","key":"1_CR12","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00208001","volume":"9","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Kahan, A.: How to construct constant-round zero-knowledge proof systems for np. J. Cryptol. 9(3), 167\u2013189 (1996)","journal-title":"J. Cryptol."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.L.: A digital signature scheme secure against adaptive chosen-message attacks. SIAM J. Comput. 17(2), 281\u2013308 (1988)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR15","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, S.J., Reingold, O., Vadhan, S.: Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function. SIAM J. Comput. 39(3), 1153\u20131218 (2009)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Lindell. Parallel coin-tossing and constant-round secure two-party computation. J. Cryptology 16, 143\u2013184 (2003)","DOI":"10.1007\/s00145-002-0143-7"},{"issue":"17","key":"1_CR18","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, H.F.: Is quantum bit commitment really possible? Phys. Rev. Lett. 78(17), 3410 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"17","key":"1_CR19","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1103\/PhysRevLett.78.3414","volume":"78","author":"D Mayers","year":"1997","unstructured":"Mayers, D.: Unconditionally secure quantum bit commitment is impossible. Phys. Rev. Lett. 78(17), 3414 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Vadhan, S.P.: Statistical zero-knowledge proofs with efficient provers: lattice problems and more. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 282\u2013298. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45146-4_17","DOI":"10.1007\/978-3-540-45146-4_17"},{"key":"1_CR21","unstructured":"Morimae, T., Yamakawa, T.: Proofs of quantumness from trapdoor permutations. arXiv preprint arXiv:2208.12390 (2022)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Morimae, T., Yamakawa, T.: Quantum commitments and signatures without one-way functions. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I, vol. 13507. LNCS, pp. 269\u2013295. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_10"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. J. Cryptol. 4(2), 151\u2013158 (1991). https:\/\/doi.org\/10.1007\/BF00196774","journal-title":"J. Cryptol."},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for np using any one-way permutation. J. Cryptol. 11, 87\u2013108 (1998)","journal-title":"J. Cryptol."},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Nguyen, M.-H., Vadhan, S.: Zero knowledge with efficient provers. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of computing, pp. 287\u2013295 (2006)","DOI":"10.1145\/1132516.1132559"},{"key":"1_CR27","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information. Cambridge university press (2010)"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Ong, S.J., Vadhan, S.: An Equivalence Between Zero Knowledge and Commitments. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 482\u2013500. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_27","DOI":"10.1007\/978-3-540-78524-8_27"},{"key":"1_CR29","unstructured":"Ostrovsky, R., Wigderson, A.: One-way functions are essential for non-trivial zero-knowledge. In: [1993] The 2nd Israel Symposium on Theory and Computing Systems, pp. 3\u201317. IEEE (1993)"},{"key":"1_CR30","unstructured":"Popa, R.A.: Witness-indistinguishability against quantum adversaries. Project Report (2011)"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Shmueli, O., Zhandry, M.: On one-shot signatures, quantum vs. classical binding, and obfuscating permutations. In: Annual International Cryptology Conference, pp. 350\u2013383. Springer (2025)","DOI":"10.1007\/978-3-032-01878-6_12"},{"key":"1_CR32","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Collapse-binding quantum commitments without random oracles. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 166\u2013195. Springer (2016)","DOI":"10.1007\/978-3-662-53890-6_6"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Unruh, D.: Computationally binding quantum commitments. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 497\u2013527. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_18","DOI":"10.1007\/978-3-662-49896-5_18"},{"issue":"4","key":"1_CR34","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1137\/S0097539705447207","volume":"36","author":"SP Vadhan","year":"2006","unstructured":"Vadhan, S.P.: An unconditional study of computational zero knowledge. SIAM J. Comput. 36(4), 1160\u20131214 (2006)","journal-title":"SIAM J. Comput."},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 296\u2013305 (2006)","DOI":"10.1145\/1132516.1132560"},{"issue":"6","key":"1_CR36","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1049\/iet-ifs.2018.5460","volume":"13","author":"H Xie","year":"2019","unstructured":"Xie, H., Yang, L.: Witness indistinguishability and witness hiding against quantum attacks. IET Inf. Secur. 13(6), 579\u2013590 (2019)","journal-title":"IET Inf. Secur."}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6203-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:37:07Z","timestamp":1773214627000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6203-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819562022","9789819562039"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6203-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc22025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2025.xidian.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}