{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:10:02Z","timestamp":1778249402749,"version":"3.51.4"},"publisher-location":"Cham","reference-count":31,"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_16","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:13:09Z","timestamp":1778245989000},"page":"446-474","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Modular Approach to\u00a0Succinct Arguments for\u00a0QMA"],"prefix":"10.1007","author":[{"given":"James","family":"Bartusek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiahui","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giulio","family":"Malavolta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"16_CR1","unstructured":"Aaronson, S., Atia, Y., Susskind, L.: On the hardness of detecting macroscopic superpositions. arXiv preprint arXiv:2009.07450 (2020)"},{"key":"16_CR2","unstructured":"Aharonov, D., Arad, I., Vidick, T.: The quantum PCP conjecture (2013)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-030-64381-2_6","volume-title":"Theory of Cryptography","author":"G Alagic","year":"2020","unstructured":"Alagic, G., Childs, A.M., Grilo, A.B., Hung, S.-H.: Non-interactive classical verification of quantum computation. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part III. LNCS, vol. 12552, pp. 153\u2013180. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64381-2_6"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Alamati, N., Malavolta, G., Rahimi, A.: Candidate trapdoor claw-free functions from group actions with applications to quantum protocols. In: Kiltz, E., Vaikuntanathan, V. (eds.) TCC 2022, Part I. LNCS, vol. 13747, pp. 266\u2013293. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-22318-1_10","DOI":"10.1007\/978-3-031-22318-1_10"},{"issue":"3","key":"16_CR5","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR6","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70\u2013122 (1998)","journal-title":"J. ACM"},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Bacho, K., Kulpe, A., Malavolta, G., Schmidt, S., Walter, M.: Compiled nonlocal games from any trapdoor claw-free function. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025, Part II. LNCS, vol. 16001, pp. 642\u2013673, Berlin, Heidelberg, 2025. Springer-Verlag (2025). https:\/\/doi.org\/10.1007\/978-3-032-01878-6_21","DOI":"10.1007\/978-3-032-01878-6_21"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Bartusek, J., et al.: Succinct classical verification of quantum computation. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13508, pp. 195\u2013211. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_7","DOI":"10.1007\/978-3-031-15979-4_7"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Bartusek, J., Khurana, D.: On the power of oblivious state preparation. In: Tauman Kalai, Y., Kamara, S.F. (eds.) CRYPTO 2025. LNCS, vol. 16001, pp. 575\u2013607. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-032-01878-6_19","DOI":"10.1007\/978-3-032-01878-6_19"},{"key":"16_CR10","unstructured":"Bartusek, J., Liu, J., Malavolta, G.: A modular approach to succinct arguments for QMA (2026)"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Christiano, P., Mahadev, U., Vazirani, U., Vidick, T.: A cryptographic test of quantumness and certifiable randomness from a single quantum device. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 320\u2013331 (2018)","DOI":"10.1109\/FOCS.2018.00038"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Branco, P., Malavolta, G., Maradni, Z.: Fully-homomorphic encryption from lattice isomorphism. Cryptology ePrint Archive, Paper 2025\/993 (2025)","DOI":"10.1007\/978-3-032-12287-2_8"},{"key":"16_CR13","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), Los Alamitos, CA, USA, pp. 49\u201358. IEEE Computer Society (2022)","DOI":"10.1109\/FOCS52979.2021.00014"},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Chung, K.-M., Lee, Y., Lin, H.-H., Wu, X.: Constant-round blind classical verification of quantum sampling. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 707\u2013736. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_25","DOI":"10.1007\/978-3-031-07082-2_25"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Gunn, S., Ju, N., Ma, F., Zhandry, M.: Commitments to quantum states. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pp. 1579\u20131588. Association for Computing Machinery, New York (2023)","DOI":"10.1145\/3564246.3585198"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Gunn, S., Kalai, Y.T., Natarajan, A., Vill\u00e1nyi, \u00c1.: Classical commitments to quantum states. In: Proceedings of the 57th Annual ACM Symposium on Theory of Computing, STOC 2025, pp. 234\u2013244. Association for Computing Machinery, New York (2025)","DOI":"10.1145\/3717823.3718264"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Hhan, M., Morimae, T., Yamakawa, T.: From the hardness of detecting superpositions to cryptography: Quantum public key encryption and commitments. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14004, pp. 639\u2013667. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_22","DOI":"10.1007\/978-3-031-30545-0_22"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Hub\u00e1\u010dek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: TCC 2015, Part I. LNCS, vol. 9014, pp. 439\u2013474. Springer, Cham (2015)","DOI":"10.1145\/2688073.2688105"},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Yang, L.: Quantum advantage from any non-local game. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 1617\u20131628 (2023)","DOI":"10.1145\/3564246.3585164"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC), pp. 723\u2013732. ACM (1992)","DOI":"10.1145\/129712.129782"},{"key":"16_CR21","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 Symposium on Foundations of Computer Science (FOCS), pp. 601\u2013612. IEEE (2022)","DOI":"10.1109\/FOCS54457.2022.00086"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical homomorphic encryption for quantum circuits. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 332\u2013338. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00039"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Mahadev, U.: Classical verification of quantum computations. In: Proceedings of the 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS 2018), pp. 259\u2013267. IEEE (2018)","DOI":"10.1109\/FOCS.2018.00033"},{"key":"16_CR24","doi-asserted-by":"publisher","unstructured":"Malavolta, G., Walter, M.: Robust quantum public-key encryption with applications to quantum key distribution. In: Reyzin, L., Stebila, D. (eds.) CRYPTO 2024. LNCS, vol. 14926, pp. 126\u2013151. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-68394-7_5","DOI":"10.1007\/978-3-031-68394-7_5"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Metger, T., Natarajan, A., Zhang, T.: Succinct arguments for QMA from standard assumptions via compiled nonlocal games. In: 2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1193\u20131201. IEEE (2024)","DOI":"10.1109\/FOCS61266.2024.00078"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Natarajan, A., Zhang, T.: Bounding the quantum value of compiled nonlocal games: from CHSH to BQP verification. In: 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pp. 1342\u20131348. IEEE (2023)","DOI":"10.1109\/FOCS57990.2023.00081"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/978-3-662-49896-5_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"D Unruh","year":"2016","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"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets. In: 27th Annual Symposium on foundations of computer science (SFCS 1986), pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"},{"key":"16_CR29","doi-asserted-by":"publisher","unstructured":"Zhandry, M.: New constructions of collapsing hashes. In: Dodis, Y., Shrimpton, T. (eds) CRYPTO 2022. LNCS, vol. 13509, pp. 596\u2013624. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_20","DOI":"10.1007\/978-3-031-15982-4_20"},{"key":"16_CR30","unstructured":"Zhang, J.: A quantum approach for reducing communications in classical secure computations with long outputs. Cryptology ePrint Archive, Paper 2023\/1492 (2023)"},{"key":"16_CR31","unstructured":"Zhang, J.: Formulations and constructions of remote state preparation with verifiability, with applications (2025)"}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T13:13:18Z","timestamp":1778245998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-25336-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032253354","9783032253361"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-25336-1_16","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"}}]}}