{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:49:31Z","timestamp":1770900571518,"version":"3.50.1"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031486203","type":"print"},{"value":"9783031486210","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48621-0_12","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"333-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Holographic SNARGs for\u00a0P and\u00a0Batch-NP from\u00a0(Polynomially Hard) Learning with\u00a0Errors"],"prefix":"10.1007","author":[{"given":"Susumu","family":"Kiyoshima","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: 23rd ACM STOC, pp. 21\u201331. ACM Press, May 1991. https:\/\/doi.org\/10.1145\/103418.103428","DOI":"10.1145\/103418.103428"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Badrinarayanan, S., Kalai, Y.T., Khurana, D., Sahai, A., Wichs, D.: Succinct delegation for low-space non-deterministic computation. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 709\u2013721. ACM Press, June 2018. https:\/\/doi.org\/10.1145\/3188745.3188924","DOI":"10.1145\/3188745.3188924"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kalai, Y.T., Paneth, O.: Multi-collision resistance: a paradigm for keyless hash functions. In: Diakonikolas, I., Kempe, D., Henzinger, M. (eds.) 50th ACM STOC, pp. 671\u2013684. ACM Press, June 2018. https:\/\/doi.org\/10.1145\/3188745.3188870","DOI":"10.1145\/3188745.3188870"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Holmgren, J., Kalai, Y.T.: Non-interactive delegation and batch NP verification from standard computational assumptions. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th ACM STOC, pp. 474\u2013482. ACM Press, June 2017. https:\/\/doi.org\/10.1145\/3055399.3055497","DOI":"10.1145\/3055399.3055497"},{"key":"12_CR5","doi-asserted-by":"publisher","unstructured":"Bronfman, L., Rothblum, R.D.: PCPs and instance compression from a cryptographic lens. In: Braverman, M. (ed.) 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), vol. 215, pp. 30:1\u201330:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2022.30. https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/15626","DOI":"10.4230\/LIPIcs.ITCS.2022.30"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4), 557\u2013594 (2004). https:\/\/doi.org\/10.1145\/1008731.1008734","journal-title":"J. ACM"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1007\/978-3-030-45721-1_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Hu, Y., Maller, M., Mishra, P., Vesely, N., Ward, N.: Marlin: preprocessing zkSNARKs with universal and updatable SRS. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 738\u2013768. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_26"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1007\/978-3-030-45721-1_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2020","author":"A Chiesa","year":"2020","unstructured":"Chiesa, A., Ojha, D., Spooner, N.: Fractal: post-quantum and transparent recursive proofs from holography. In: Canteaut, A., Ishai, Y. (eds.) EUROCRYPT 2020. LNCS, vol. 12105, pp. 769\u2013793. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45721-1_27"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-030-84259-8_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"AR Choudhuri","year":"2021","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Non-interactive batch arguments for NP from standard assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12828, pp. 394\u2013423. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_14"},{"key":"12_CR10","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal{{P}} $$ from LWE. Cryptology ePrint Archive, Report 2021\/808, Version 20211108:181325 (2021). https:\/\/eprint.iacr.org\/2021\/808. An extended version of [11]"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal{P} $$ from LWE. In: 62nd FOCS, pp. 68\u201379. IEEE Computer Society Press, February 2022. https:\/\/doi.org\/10.1109\/FOCS52979.2021.00016","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-22792-9_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"K-M Chung","year":"2011","unstructured":"Chung, K.-M., Kalai, Y.T., Liu, F.-H., Raz, R.: Memory delegation. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 151\u2013168. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_9"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. In: 63rd FOCS, pp. 1057\u20131068. IEEE Computer Society Press, October\/November 2022. https:\/\/doi.org\/10.1109\/FOCS54457.2022.00103","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM 62(4), 27:1\u201327:64 (2015)","DOI":"10.1145\/2699436"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Gur, T., Rothblum, R.D.: A hierarchy theorem for interactive proofs of proximity. In: Papadimitriou, C.H. (ed.) ITCS 2017, vol. 4266, pp. 39:1\u201339:43. LIPIcs, 67, January 2017. https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2017.39","DOI":"10.4230\/LIPIcs.ITCS.2017.39"},{"key":"12_CR16","unstructured":"Holmgren, J., Lombardi, A., Rothblum, R.D.: Fiat-Shamir via list-recoverable codes (or: Parallel repetition of GMW is not zero-knowledge). Cryptology ePrint Archive, Report 2021\/286, Version 20210307:022349 (2021). https:\/\/eprint.iacr.org\/2021\/286. An extended version of [17]"},{"key":"12_CR17","doi-asserted-by":"publisher","unstructured":"Holmgren, J., Lombardi, A., Rothblum, R.D.: Fiat-Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge). In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, p. 750\u2013760. ACM Press, June 2021. https:\/\/doi.org\/10.1145\/3406325.3451116","DOI":"10.1145\/3406325.3451116"},{"key":"12_CR18","doi-asserted-by":"publisher","unstructured":"Holmgren, J., Rothblum, R.: Delegating computations with (almost) minimal time and space overhead. In: Thorup, M. (ed.) 59th FOCS, pp. 124\u2013135. IEEE Computer Society Press, October 2018. https:\/\/doi.org\/10.1109\/FOCS.2018.00021","DOI":"10.1109\/FOCS.2018.00021"},{"key":"12_CR19","doi-asserted-by":"publisher","unstructured":"Hsiao, C.Y., Reyzin, L.: Finding collisions on a public road, or do secure hash functions need secret coins? In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 92\u2013105. Springer, Heidelberg (Aug 2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_6","DOI":"10.1007\/978-3-540-28628-8_6"},{"key":"12_CR20","doi-asserted-by":"publisher","unstructured":"Hubacek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: Roughgarden, T. (ed.) ITCS 2015, pp. 163\u2013172. ACM, January 2015. https:\/\/doi.org\/10.1145\/2688073.2688105","DOI":"10.1145\/2688073.2688105"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Hulett, J., Jawale, R., Khurana, D., Srinivasan, A.: SNARGs for P from sub-exponential DDH and QR. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 520\u2013549. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_18","DOI":"10.1007\/978-3-031-07085-3_18"},{"key":"12_CR22","doi-asserted-by":"publisher","unstructured":"Jawale, R., Kalai, Y.T., Khurana, D., Zhang, R.Y.: SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE. In: Khuller, S., Williams, V.V. (eds.) 53rd ACM STOC, pp. 708\u2013721. ACM Press, June 2021. https:\/\/doi.org\/10.1145\/3406325.3451055","DOI":"10.1145\/3406325.3451055"},{"key":"12_CR23","unstructured":"Kalai, Y., Paneth, O., Yang, L.: How to delegate computations publicly. Cryptology ePrint Archive, Report 2019\/603, Version 20190602:113205 (2019). https:\/\/eprint.iacr.org\/2019\/603. An extended version of [25]"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Paneth, O.: Delegating RAM computations. In: Hirt, M., Smith, A.D. (eds.) TCC 2016-B, Part II. LNCS, vol. 9986, pp. 91\u2013118. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53644-5_4","DOI":"10.1007\/978-3-662-53644-5_4"},{"key":"12_CR25","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: How to delegate computations publicly. In: Charikar, M., Cohen, E. (eds.) 51st ACM STOC, pp. 1115\u20131124. ACM Press, June 2019. https:\/\/doi.org\/10.1145\/3313276.3316411","DOI":"10.1145\/3313276.3316411"},{"issue":"1","key":"12_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3456867","volume":"69","author":"YT Kalai","year":"2022","unstructured":"Kalai, Y.T., Raz, R., Rothblum, R.D.: How to delegate computations: the power of no-signaling proofs. J. ACM 69(1), 1\u201382 (2022). https:\/\/doi.org\/10.1145\/3456867","journal-title":"J. ACM"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-662-48000-7_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","author":"YT Kalai","year":"2015","unstructured":"Kalai, Y.T., Rothblum, R.D.: Arguments of proximity - [extended abstract]. In: Gennaro, R., Robshaw, M. (eds.) CRYPTO 2015. LNCS, vol. 9216, pp. 422\u2013442. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_21"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Kalai, Y.T., Vaikuntanathan, V., Zhang, R.Y.: Somewhere statistical soundness, post-quantum security, and SNARGs. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part I. LNCS, vol. 13042, pp. 330\u2013368. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_12","DOI":"10.1007\/978-3-030-90459-3_12"},{"key":"12_CR29","doi-asserted-by":"publisher","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: 24th ACM STOC, pp. 723\u2013732. ACM Press, May 1992. https:\/\/doi.org\/10.1145\/129712.129782","DOI":"10.1145\/129712.129782"},{"key":"12_CR30","doi-asserted-by":"publisher","unstructured":"Kiyoshima, S.: Public-coin 3-round zero-knowledge from Learning with Errors and keyless multi-collision-resistant hash. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part I. LNCS, vol. 13507, pp. 444\u2013473. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_16","DOI":"10.1007\/978-3-031-15802-5_16"},{"key":"12_CR31","doi-asserted-by":"publisher","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: 63rd FOCS, pp. 1045\u20131056. IEEE Computer Society Press, October\/November 2022. https:\/\/doi.org\/10.1109\/FOCS54457.2022.00102","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"12_CR32","doi-asserted-by":"publisher","unstructured":"Rothblum, G.N., Vadhan, S.P., Wigderson, A.: Interactive proofs of proximity: delegating computation in sublinear time. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) 45th ACM STOC, pp. 793\u2013802. ACM Press, June 2013. https:\/\/doi.org\/10.1145\/2488608.2488709","DOI":"10.1145\/2488608.2488709"},{"key":"12_CR33","doi-asserted-by":"publisher","unstructured":"Waters, B., Wu, D.J.: Batch arguments for NP and more from standard bilinear group assumptions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 433\u2013463. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_15","DOI":"10.1007\/978-3-031-15979-4_15"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48621-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:03:07Z","timestamp":1764118987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48621-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486203","9783031486210"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48621-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","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":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}