{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:39:01Z","timestamp":1759365541565,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":47,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032067531","type":"print"},{"value":"9783032067548","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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-3-032-06754-8_2","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:23:01Z","timestamp":1759306981000},"page":"43-75","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Post-Quantum Zero-Knowledge with\u00a0Space-Bounded Simulation"],"prefix":"10.1007","author":[{"given":"Prabhanjan","family":"Ananth","sequence":"first","affiliation":[]},{"given":"Alex B.","family":"Grilo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"349","DOI":"10.4086\/toc.2013.v009a009","volume":"9","author":"S Aaronson","year":"2013","unstructured":"Aaronson, S., Christiano, P.: Quantum money from hidden subspaces. Theory Comput. 9, 349\u2013401 (2013)","journal-title":"Theory Comput."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, A., Bartusek, J., Goyal, V., Khurana, D., Malavolta, G.: Post-quantum multi-party computation in constant rounds. arXiv preprint arXiv:2005.12904 (2020)","DOI":"10.1007\/978-3-030-77870-5_16"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-030-84242-0_13","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"P Ananth","year":"2021","unstructured":"Ananth, P., Chung, K.-M., Placa, R.L.L.: On the concurrent composition of quantum zero-knowledge. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 346\u2013374. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_13"},{"key":"2_CR4","unstructured":"Ananth, P., Grilo, A.B.: Post-quantum zero-knowledge with space-bounded simulation. arXiv preprint arXiv:2210.06093 (2022)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-64381-2_5","volume-title":"Theory of Cryptography","author":"P Ananth","year":"2020","unstructured":"Ananth, P., La Placa, R.L.: Secure quantum extraction protocols. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12552, pp. 123\u2013152. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_5"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574, 505\u2013510 (2019)","journal-title":"Nature"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-48329-2_8","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"Y Aumann","year":"1994","unstructured":"Aumann, Y., Feige, U.: One message proof systems with known space verifiers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 85\u201399. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_8"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/978-3-030-84242-0_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Bartusek","year":"2021","unstructured":"Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: One-way functions imply secure computation in a quantum world. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 467\u2013496. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_17"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-90459-3_3","volume-title":"Theory of Cryptography","author":"N Bitansky","year":"2021","unstructured":"Bitansky, N., Kellner, M., Shmueli, O.: Post-quantum resettably-sound zero knowledge. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 62\u201389. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_3"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Shmueli, O.: Post-quantum zero knowledge in constant rounds. In: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pp. 269\u2013279 (2020)","DOI":"10.1145\/3357713.3384324"},{"key":"2_CR11","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, vol. 1, p. 2. Citeseer (1986)"},{"key":"2_CR12","unstructured":"Broadbent, A., Grilo, A.B.: Zero-knowledge for QMA from locally simulatable proofs. arXiv preprint arXiv:1911.07782 (2019)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Ji, Z., Song, F., Watrous, J.: Zero-knowledge proof systems for QMA. In: 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS), pp. 31\u201340. IEEE (2016)","DOI":"10.1109\/FOCS.2016.13"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Chen, S., Cotler, J., Huang, H.Y., Li, J.: The complexity of NISQ (2022)","DOI":"10.1038\/s41467-023-41217-6"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Chia, N.H., Chung, K.M., Liang, X., Yamakawa, T.: Post-quantum simulatable extraction with minimal assumptions: black-box and constant-round. arXiv preprint arXiv:2111.08665 (2021)","DOI":"10.1007\/978-3-031-15982-4_18"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Chia, N.H., Chung, K.M., Liu, Q., Yamakawa, T.: On the impossibility of post-quantum black-box zero-knowledge in constant round. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 59\u201367. IEEE (2021)","DOI":"10.1109\/FOCS52979.2021.00015"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-030-84242-0_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"N-H Chia","year":"2021","unstructured":"Chia, N.-H., Chung, K.-M., Yamakawa, T.: A black-box approach to post-quantum zero-knowledge in constant rounds. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12825, pp. 315\u2013345. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_12"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Chiesa, A., Ma, F., Spooner, N., Zhandry, M.: Post-quantum succinct arguments: breaking the quantum rewinding barrier. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 49\u201358. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/978-3-642-28914-9_29","volume-title":"Theory of Cryptography","author":"K-M Chung","year":"2012","unstructured":"Chung, K.-M., Pass, R., Tseng, W.-L.D.: The knowledge tightness of parallel zero-knowledge. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 512\u2013529. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_29"},{"issue":"6","key":"2_CR20","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0375-9601(82)90084-6","volume":"92","author":"DGBJ Dieks","year":"1982","unstructured":"Dieks, D.G.B.J.: Communication by EPR devices. Phys. Lett. A 92(6), 271\u2013272 (1982)","journal-title":"Phys. Lett. A"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-642-24316-5_4","volume-title":"Provable Security","author":"N Ding","year":"2011","unstructured":"Ding, N., Gu, D.: Precise time and space simulatable zero-knowledge. In: Boyen, X., Chen, X. (eds.) ProvSec 2011. LNCS, vol. 6980, pp. 16\u201333. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24316-5_4"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-34129-8_16","volume-title":"Information and Communications Security","author":"N Ding","year":"2012","unstructured":"Ding, N., Gu, D.: On constant-round precise zero-knowledge. In: Chim, T.W., Yuen, T.H. (eds.) ICICS 2012. LNCS, vol. 7618, pp. 178\u2013190. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34129-8_16"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 1: Basic Techniques (2001)","DOI":"10.1017\/CBO9780511546891"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1137\/S0097539791220688","volume":"25","author":"O Goldreich","year":"1996","unstructured":"Goldreich, O., Krawczyk, H.: On the composition of zero-knowledge proof systems. SIAM J. Comput. 25(1), 169\u2013192 (1996)","journal-title":"SIAM J. Comput."},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: 27th Annual Symposium on Foundations of Computer Science, pp. 174\u2013187. IEEE (1986)","DOI":"10.1109\/SFCS.1986.47"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Micali, S., Goldreich, O., Wigderson, A.: How to play any mental game. In: STOC (1987)","DOI":"10.1145\/28395.28420"},{"issue":"1","key":"2_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich, O., Oren, Y.: Definitions and properties of zero-knowledge proof systems. J. Cryptol. 7(1), 1\u201332 (1994). https:\/\/doi.org\/10.1007\/BF00195207","journal-title":"J. Cryptol."},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: STOC, pp. 291\u2013304 (1985)","DOI":"10.1145\/22145.22178"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-030-77886-6_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"AB Grilo","year":"2021","unstructured":"Grilo, A.B., Lin, H., Song, F., Vaikuntanathan, V.: Oblivious transfer is in MiniQCrypt. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 531\u2013561. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_18"},{"key":"2_CR30","doi-asserted-by":"crossref","unstructured":"Hallgren, S., Smith, A., Song, F.: Classical cryptographic protocols in a quantum world. In: Annual Cryptology Conference, pp. 411\u2013428. Springer (2011)","DOI":"10.1007\/978-3-642-22792-9_23"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Lombardi, A.: Cryptographic hashing from strong one-way functions (or: one-way product functions and their applications). In: 2018 IEEE 59th annual symposium on Foundations of Computer Science (FOCS), pp. 850\u2013858. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00085"},{"key":"2_CR32","unstructured":"Jain, R., Kolla, A., Midrijanis, G., Reichardt, B.W.: On parallel composition of zero-knowledge proofs with black-box quantum simulators. arXiv preprint quant-ph\/0607211 (2006)"},{"key":"2_CR33","doi-asserted-by":"crossref","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited (or: how to do quantum rewinding undetectably). arXiv preprint arXiv:2111.12257 (2021)","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Micali, S., Pass, R.: Local zero knowledge. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 306\u2013315 (2006)","DOI":"10.1145\/1132516.1132561"},{"key":"2_CR35","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":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/978-3-540-78967-3_23","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"O Pandey","year":"2008","unstructured":"Pandey, O., Pass, R., Sahai, A., Tseng, W.-L.D., Venkitasubramaniam, M.: Precise concurrent zero knowledge. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 397\u2013414. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78967-3_23"},{"key":"2_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-55719-9_61","volume-title":"Automata, Languages and Programming","author":"A Santis","year":"1992","unstructured":"Santis, A., Persiano, G., Yung, M.: One-message statistical zero-knowledge proofs and space-bounded verifier. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 28\u201340. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55719-9_61"},{"key":"2_CR38","unstructured":"Sasson, E.B., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, pp. 459\u2013474. IEEE (2014)"},{"issue":"2","key":"2_CR39","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"2_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-642-29011-4_10","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Unruh","year":"2012","unstructured":"Unruh, D.: Quantum proofs of knowledge. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 135\u2013152. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_10"},{"key":"2_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-40084-1_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"D Unruh","year":"2013","unstructured":"Unruh, D.: Everlasting multi-party computation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 380\u2013397. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_22"},{"key":"2_CR42","unstructured":"Van De Graaf, J.: Towards a formal definition of security for quantum protocols. Citeseer (1997)"},{"issue":"1","key":"2_CR43","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1137\/060670997","volume":"39","author":"J Watrous","year":"2009","unstructured":"Watrous, J.: Zero-knowledge against quantum attacks. SIAM J. Comput. 39(1), 25\u201358 (2009)","journal-title":"SIAM J. Comput."},{"issue":"5886","key":"2_CR44","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1038\/299802a0","volume":"299","author":"WK Wootters","year":"1982","unstructured":"Wootters, W.K., Zurek, W.H.: A single quantum cannot be cloned. Nature 299(5886), 802\u2013803 (1982)","journal-title":"Nature"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Zhandry, M.: Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions. J. Cryptol. 34(1), Paper No. 6, 56 (2021)","DOI":"10.1007\/s00145-020-09372-x"},{"key":"2_CR46","unstructured":"Zhandry, M.: The space-time cost of purifying quantum computations. arXiv preprint arXiv:2401.07974 (2024)"},{"key":"2_CR47","unstructured":"Zhong, H.-S., et al.: Quantum computational advantage using photons. Science (2021)"}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2013 LATINCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-06754-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T08:23:14Z","timestamp":1759306994000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-06754-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032067531","9783032067548"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-06754-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATINCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Information Security in Latin America","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Medell\u00edn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Colombia","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":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latincrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ciencias.medellin.unal.edu.co\/eventos\/latincrypt\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}