{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:09:59Z","timestamp":1778249399473,"version":"3.51.4"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032253354","type":"print"},{"value":"9783032253361","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-3-032-25336-1_15","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:12:30Z","timestamp":1778245950000},"page":"416-445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Black-Box Simulation Barrier Persists in\u00a0a\u00a0Fully Quantum World"],"prefix":"10.1007","author":[{"given":"Nai-Hui","family":"Chia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai-Min","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0858-9289","authenticated-orcid":false,"given":"Xiao","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, V., Bartusek, J., Goyal, V., Khurana, D., Malavolta, G.: Post-quantum multi-party computation. In: Canteaut, A., Standaert, F.-X., (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0I, volume 12696 of Lecture Notes in Computer Science, pp. 435\u2013464, Zagreb, Croatia, 17\u201321 Oct (2021). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-77870-5_16"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Ananth, P., Chung, K.-M., La Placa, R.\u00a0L.: On the concurrent composition of quantum zero-knowledge. In: Malkin, T., Peikert, C., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0I, volume 12825 of Lecture Notes in Computer Science, pp. 346\u2013374, Virtual Event, 16\u201320 Aug (2021). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-84242-0_13"},{"key":"15_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 \u2013 CRYPTO\u00a02022, Part\u00a0I, volume 13507 of Lecture Notes in Computer Science, pp. 208\u2013236, Santa Barbara, CA, USA, 15\u201318 Aug (2022). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-031-15802-5_8"},{"key":"15_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: Dodis, Y., Shrimpton, T., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0II, volume 13508 of Lecture Notes in Computer Science, pp. 165\u2013194, Santa Barbara, CA, USA, 15\u201318 Aug 2022. Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-031-15979-4_6"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Barak, B., Lindell, Y.: Strict polynomial-time in simulation and extraction. In: 34th Annual ACM Symposium on Theory of Computing, pp. 484\u2013493, Montr\u00e9al, Qu\u00e9bec, Canada, 19\u201321 May (2002). ACM Press","DOI":"10.1145\/509907.509979"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bartusek, J., Coladangelo, A., Khurana, D., Ma, F.: On the round complexity of secure quantum computation. In: Malkin, T., Peikert, C., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0I, volume 12825 of Lecture Notes in Computer Science, pp. 406\u2013435, Virtual Event, 16\u201320 Aug (2021). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-84242-0_15"},{"key":"15_CR7","doi-asserted-by":"crossref","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.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0I, volume 12825 of Lecture Notes in Computer Science, pp. 467\u2013496, Virtual Event, 16\u201320 Aug (2021). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-84242-0_17"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Bellare, M., Jakobsson, M., Yung, M.: Round-optimal zero-knowledge arguments based on any one-way function. In: Fumy, W., (eds.) Advances in Cryptology \u2013 EUROCRYPT\u201997, volume 1233 of Lecture Notes in Computer Science, pp. 280\u2013305, Konstanz, Germany, 11\u201315 May (1997). Springer, Heidelberg, Germany","DOI":"10.1007\/3-540-69053-0_20"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., Ostrovsky, R.: The (true) complexity of statistical zero knowledge. In: 22nd Annual ACM Symposium on Theory of Computing, pp. 494\u2013502, Baltimore, MD, USA, 14\u201316 May (1990). ACM Press","DOI":"10.1145\/100216.100285"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldreich, O., Goldwasser, S., H\u00e5stad, J., Kilian, V., Micali, S., Rogaway, P.: Everything provable is provable in zero-knowledge. In: Goldwasser, S., (eds.) Advances in Cryptology \u2013 CRYPTO\u201988, volume 403 of Lecture Notes in Computer Science, pp. 37\u201356, Santa Barbara, CA, USA, 21\u201325 Aug 1990. Springer, Heidelberg, Germany","DOI":"10.1007\/0-387-34799-2_4"},{"key":"15_CR11","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, pp. 175\u2013179 (1984)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Shmueli, O.: Post-quantum zero knowledge in constant rounds. In: Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G., Chuzhoy, J., (eds.) 52nd Annual ACM Symposium on Theory of Computing, pp. 269\u2013279, Chicago, IL, USA, 22\u201326 June (2020). ACM Press","DOI":"10.1145\/3357713.3384324"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Bostanci, J., Qian, L., Spooner, N., Yuen, H.: An efficient quantum parallel repetition theorem and applications. In: 2024 Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC (2024)","DOI":"10.1145\/3618260.3649603"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(91)90259-5","volume":"84","author":"G Brassard","year":"1991","unstructured":"Brassard, G., Cr\u00e9peau, C., Yung, M.: Constant-round perfect zero-knowledge computationally convincing protocols. Theoret. Comput. Sci. 84(1), 23\u201352 (1991)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Grilo, A.B.: QMA-hardness of consistency of local density matrices with applications to quantum zero-knowledge. In: 61st Annual Symposium on Foundations of Computer Science, pp. 196\u2013205, Durham, NC, USA, 16\u201319 Nov (2020). IEEE Computer Society Press","DOI":"10.1109\/FOCS46700.2020.00027"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Broadbent, A., Ji, Z., Song, F., Watrous, J.: Zero-knowledge proof systems for QMA. In: Dinur, I., (eds.) 57th Annual Symposium on Foundations of Computer Science, pp. 31\u201340, New Brunswick, NJ, USA, 9\u201311 Oct (2016). IEEE Computer Society Press","DOI":"10.1109\/FOCS.2016.13"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Canetti, R., Kilian, J., Petrank, E., Rosen, A.: Black-box concurrent zero-knowledge requires omega\u00a0(log n) rounds. In: 33rd Annual ACM Symposium on Theory of Computing, pp. 570\u2013579, Crete, Greece, 6\u20138 July (2001). ACM Press","DOI":"10.1145\/380752.380852"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Chatterjee, R., Liang, X., Pandey, O., Yamakawa, T.: The round complexity of black-box post-quantum secure computation. In: Annual International Cryptology Conference, pp. 3\u201335. Springer, (2025)","DOI":"10.1007\/978-3-032-01884-7_1"},{"key":"15_CR19","unstructured":"Chia, N.-H., Chung, K.-M., Liang, X., Liu, J.: The black-box simulation barrier persists in a fully quantum world. Cryptology ePrint Archive, Paper 2024\/1413 (2024)"},{"key":"15_CR20","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. In: Dodis, Y., Shrimpton, T., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02022, Part\u00a0III, volume 13509 of Lecture Notes in Computer Science, pp. 533\u2013563, Santa Barbara, CA, USA 15\u201318 Aug (2022). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-031-15982-4_18"},{"key":"15_CR21","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: IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS 2021). Also appeared in the 25th Annual Conference on Quantum Information Processing (QIP 2022) (2021)","DOI":"10.1109\/FOCS52979.2021.00015"},{"key":"15_CR22","doi-asserted-by":"crossref","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.) Advances in Cryptology \u2013 CRYPTO\u00a02021, Part\u00a0I, volume 12825 of Lecture Notes in Computer Science, pp. 315\u2013345, Virtual Event, 16\u201320 Aug (2021). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-84242-0_12"},{"key":"15_CR23","doi-asserted-by":"crossref","unstructured":"Chung, K.-M., Pass, R., Tseng, W.-L.D.: The knowledge tightness of parallel zero-knowledge. In: Cramer, R., (eds.) TCC\u00a02012: 9th Theory of Cryptography Conference, volume 7194 of Lecture Notes in Computer Science, pp. 512\u2013529, Taormina, Sicily, Italy, 19\u201321 Mar (2012). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-642-28914-9_29"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Don, J., Fehr, S., Majenz, C.: The measure-and-reprogram technique 2.0: Multi-round fiat-shamir and more. In: Micciancio, D., Ristenpart, T., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02020, Part\u00a0III, volume 12172 of Lecture Notes in Computer Science, pp. 602\u2013631, Santa Barbara, CA, USA, 17\u201321 Aug (2020). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-56877-1_21"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Don, J., Fehr, S., Majenz, C., Schaffner, C.: Security of the Fiat-Shamir transformation in the quantum random-oracle model. In: Boldyreva, A., Micciancio, D., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02019, Part\u00a0II, volume 11693 of Lecture Notes in Computer Science, pp. 356\u2013383, Santa Barbara, CA, USA, 18\u201322 Aug (2019). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-26951-7_13"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"Dulek, Y., Grilo, A.B., Jeffery, S., Majenz, C., Schaffner, C.: Secure multi-party quantum computation with a dishonest majority. In: Canteaut, A., Ishai, Y., (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02020, Part\u00a0III, volume 12107 of Lecture Notes in Computer Science, pp. 729\u2013758, Zagreb, Croatia, 10\u201314 May (2020). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-45727-3_25"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Dupuis, F., Nielsen, J.B., Salvail, L.: Actively secure two-party evaluation of any quantum operation. In: Safavi-Naini, R., Canetti, R., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02012, volume 7417 of Lecture Notes in Computer Science, pp. 794\u2013811, Santa Barbara, CA, USA, 19\u201323 Aug (2012). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-642-32009-5_46"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Feige, U., Shamir, A.: Zero knowledge proofs of knowledge in two rounds. In: Brassard, G., (eds.) Advances in Cryptology \u2013 CRYPTO\u201989, volume 435 of Lecture Notes in Computer Science, pp. 526\u2013544, Santa Barbara, CA, USA, 20\u201324 Aug (1990). Springer, Heidelberg, Germany","DOI":"10.1007\/0-387-34805-0_46"},{"key":"15_CR29","doi-asserted-by":"crossref","unstructured":"Ghosal, R., Ishai, Y., Korb, A., Kushilevitz, E., Lou, P., Sahai, A.: Hard languages in NP $$\\cap $$ conp and NIZK proofs from unstructured hardness. In: Saha, B., Servedio, R.A., (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, 20-23 June 2023, pp. 1243\u20131256. ACM (2023)","DOI":"10.1145\/3564246.3585119"},{"issue":"3","key":"15_CR30","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\u2013190 (1996)","journal-title":"J. Cryptol."},{"issue":"1","key":"15_CR31","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":"15_CR32","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 (extended abstract). In: 27th Annual Symposium on Foundations of Computer Science, pp. 174\u2013187, Toronto, Ontario, Canada, 27\u201329 Oct (1986). IEEE Computer Society Press","DOI":"10.1109\/SFCS.1986.47"},{"key":"15_CR33","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: 17th Annual ACM Symposium on Theory of Computing, pp. 291\u2013304, Providence, RI, USA May 6\u20138 (1985). ACM Press","DOI":"10.1145\/22145.22178"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Goyal, V., Liang, X., Malavolta, G.: On concurrent multi-party quantum computation. In: Annual International Cryptology Conference, pp. 129\u2013161. Springer (2023)","DOI":"10.1007\/978-3-031-38554-4_5"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Grilo, A.B., Lin, H., Song, F., Vaikuntanathan, V.: Oblivious transfer is in MiniQCrypt. In: Canteaut, A., Standaert, F.-X., (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0II, volume 12697 of Lecture Notes in Computer Science, pp. 531\u2013561, Zagreb, Croatia, 17\u201321 Oct (2021). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-77886-6_18"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Grilo, A.B., Slofstra, W., Yuen, H.: Perfect zero knowledge for quantum multiprover interactive proofs. In: Zuckerman, D., (eds.) 60th Annual Symposium on Foundations of Computer Science, pages 611\u2013635, Baltimore, MD, USA, 9\u201312 Nov (2019). IEEE Computer Society Press","DOI":"10.1109\/FOCS.2019.00044"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"Hazay, C., Pass, R., Venkitasubramaniam, M.: Which languages have 4-round fully black-box zero-knowledge arguments from one-way functions? In: Canteaut, A., Ishai, Y.,(eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02020, Part\u00a0III, volume 12107 of Lecture Notes in Computer Science, pp. 599\u2013619, Zagreb, Croatia, 10\u201314 May (2020). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-45727-3_20"},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Yung, M.: Direct minimum-knowledge computations. In: Pomerance, C., (eds.) Advances in Cryptology \u2013 CRYPTO\u201987, volume 293 of Lecture Notes in Computer Science, pp. 40\u201351, Santa Barbara, CA, USA, 16\u201320 Aug (1988). Springer, Heidelberg, Germany","DOI":"10.1007\/3-540-48184-2_4"},{"issue":"5","key":"15_CR39","first-page":"513","volume":"9","author":"R Jain","year":"2009","unstructured":"Jain, R., Kolla, A., Midrijanis, G., Reichardt, B.W.: On parallel composition of zero-knowledge proofs with black-box quantum simulators. Quantum Inf. Comput. 9(5), 513\u2013532 (2009)","journal-title":"Quantum Inf. Comput."},{"key":"15_CR40","doi-asserted-by":"crossref","unstructured":"Ji, Z., Liu, Y.-K., Song, F.: Pseudorandom quantum states. In: Shacham, H., Boldyreva, A., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02018, Part\u00a0III, volume 10993 of Lecture Notes in Computer Science, pages 126\u2013152, Santa Barbara, CA, USA, 19\u201323 Aug (2018). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-319-96878-0_5"},{"key":"15_CR41","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Rothblum, G.N., Rothblum, R.D.: From obfuscation to the security of Fiat-Shamir for proofs. In: Katz, J., Shacham, H., (eds.) Advances in Cryptology \u2013 CRYPTO\u00a02017, Part\u00a0II, volume 10402 of Lecture Notes in Computer Science, pp. 224\u2013251, Santa Barbara, CA, USA, 20\u201324 Aug (2017). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-319-63715-0_8"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Katz, J.: Which languages have 4-round zero-knowledge proofs? In: Canetti, R., (eds.) TCC\u00a02008: 5th Theory of Cryptography Conference, volume 4948 of Lecture Notes in Computer Science, pp. 73\u201388, San Francisco, CA, USA, 19\u201321 Mar (2008). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-540-78524-8_5"},{"issue":"2","key":"15_CR43","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s00037-009-0275-3","volume":"18","author":"J Kempe","year":"2009","unstructured":"Kempe, J., Kobayashi, H., Matsumoto, K., Vidick, T.: Using entanglement in quantum multi-prover interactive proofs. Comput. Complex. 18(2), 273\u2013307 (2009)","journal-title":"Comput. Complex."},{"key":"15_CR44","unstructured":"Khurana, D., Tomer, K.: Founding quantum cryptography on quantum advantage. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025 (2025)"},{"key":"15_CR45","doi-asserted-by":"crossref","unstructured":"Kitaev, A., Watrous, J.: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In: 32nd Annual ACM Symposium on Theory of Computing, pp. 608\u2013617, Portland, OR, USA, 21\u201323 May (2000). ACM Press","DOI":"10.1145\/335305.335387"},{"key":"15_CR46","unstructured":"Kretschmer, W.: Quantum pseudorandomness and classical complexity. In: Hsieh, M., (eds.) 16th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2021, 5\u20138 July (2021), Virtual Conference, volume 197 of LIPIcs, pp. 2:1\u20132:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2021"},{"key":"15_CR47","doi-asserted-by":"crossref","unstructured":"Kretschmer, W., Qian, L., Sinha, M., Tal, A.: Quantum cryptography in algorithmica. In: Saha, B., Servedio, R.A., (eds.) Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, Orlando, FL, USA, 20\u201323 June (2023), pp. 1589\u20131602. ACM (2023)","DOI":"10.1145\/3564246.3585225"},{"key":"15_CR48","doi-asserted-by":"crossref","unstructured":"Li, L., Li, Q., Li, X., Liu, Q.: How (not) to build quantum PKE in minicrypt. In: Reyzin, L., Stebila, D., (eds.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, 18-22 August 2024, Proceedings, Part VII, volume 14926 of Lecture Notes in Computer Science, pp. 152\u2013183. Springer (2024)","DOI":"10.1007\/978-3-031-68394-7_6"},{"key":"15_CR49","doi-asserted-by":"crossref","unstructured":"Liang, X., Pandey, O., Yamakawa, T.: A new approach to post-quantum non-malleability. In: 64th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2023, Santa Cruz, CA, USA, 6\u20139 November 2023, pp. 568\u2013579. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00041"},{"key":"15_CR50","doi-asserted-by":"crossref","unstructured":"Lombardi, A., Ma, F., Spooner, N.: Post-quantum zero knowledge, revisited or: How to do quantum rewinding undetectably. In: 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 851\u2013859. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"15_CR51","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 \u2013 CRYPTO\u00a02022, Part\u00a0I, volume 13507 of Lecture Notes in Computer Science, pp. 269\u2013295, Santa Barbara, CA, USA, 15\u201318 Aug (2022). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-031-15802-5_10"},{"key":"15_CR52","doi-asserted-by":"crossref","unstructured":"Sahai, A., Vadhan, S.P., A complete promise problem for statistical zero-knowledge. In: 38th Annual Symposium on Foundations of Computer Science, pp. 448\u2013457, Miami Beach, Florida, 19\u201322 Oct (1997). IEEE Computer Society Press","DOI":"10.1109\/SFCS.1997.646133"},{"key":"15_CR53","doi-asserted-by":"crossref","unstructured":"Sahai, A., Vadhan, S.P.: Manipulating statistical difference. In: Pardalos, P.M., Rajasekaran, S., Rolim, J., (eds.) Randomization Methods in Algorithm Design, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, 12\u201314 December 1997, volume\u00a043 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 251\u2013270. DIMACS\/AMS (1997)","DOI":"10.1090\/dimacs\/043\/14"},{"key":"15_CR54","doi-asserted-by":"crossref","unstructured":"Yamakawa, T., Zhandry, M.: Classical vs quantum random oracles. In: Canteaut, A., Standaert, F.-X., (eds.) Advances in Cryptology \u2013 EUROCRYPT\u00a02021, Part\u00a0II, volume 12697 of Lecture Notes in Computer Science, pp. 568\u2013597, Zagreb, Croatia, 17\u201321 Oct (2021). Springer, Heidelberg, Germany","DOI":"10.1007\/978-3-030-77886-6_20"},{"key":"15_CR55","doi-asserted-by":"crossref","unstructured":"Yan, J.: General properties of quantum bit commitments (extended abstract). In: Agrawal, S., Lin, D., (eds.) Advances in Cryptology - ASIACRYPT 2022 - 28th International Conference on the Theory and Application of Cryptology and Information Security, Taipei, Taiwan, 5\u20139 December 2022, Proceedings, Part IV, volume 13794 of Lecture Notes in Computer Science, pp. 628\u2013657. Springer (2022)","DOI":"10.1007\/978-3-031-22972-5_22"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2026"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-25336-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:12:54Z","timestamp":1778245974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_15","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":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EUROCRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 May 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}