{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:40:06Z","timestamp":1745667606918,"version":"3.40.4"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031911330","type":"print"},{"value":"9783031911347","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-91134-7_12","type":"book-chapter","created":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:04:41Z","timestamp":1745665481000},"page":"333-362","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Query-Reusable Proof Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-4096-6305","authenticated-orcid":false,"given":"Yuval","family":"Ishai","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-9277-3863","authenticated-orcid":false,"given":"Eyal","family":"Kushilevitz","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-6620-2754","authenticated-orcid":false,"given":"Varun","family":"Narayanan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1501-1330","authenticated-orcid":false,"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-4737-0430","authenticated-orcid":false,"given":"Akash","family":"Shah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,27]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 2087\u20132104. ACM Press, October\/November 2017","DOI":"10.1145\/3133956.3134104"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Arora, S., Safra, S.: Probabilistic checking of proofs; a new characterization of NP. In: 33rd FOCS, pp. 2\u201313. IEEE Computer Society Press, October 1992","DOI":"10.1109\/SFCS.1992.267824"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O.: Universal arguments and their applications. In: Proceedings 17th IEEE Annual Conference on Computational Complexity, pp. 194\u2013203. IEEE (2002)","DOI":"10.1109\/CCC.2002.1004355"},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00145-016-9241-9","volume":"30","author":"N Bitansky","year":"2017","unstructured":"Bitansky, N., et al.: The hunting of the SNARK. J. Cryptol. 30(4), 989\u20131066 (2017)","journal-title":"J. Cryptol."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Lawrence Carter, J., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Chase, M., et al.: Post-quantum zero-knowledge and signatures from symmetric-key primitives. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017, pp. 1825\u20131842. ACM Press, October\/November 2017","DOI":"10.1145\/3133956.3133997"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-030-26954-8_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Chase","year":"2019","unstructured":"Chase, M., et al.: Reusable non-interactive secure computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 462\u2013488. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_15"},{"key":"12_CR8","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_CR9","doi-asserted-by":"publisher","unstructured":"Couteau, G., Jain, A., Jin, Z., Quach, W.: A note on non-interactive zero-knowledge from CDH. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023, Part IV. LNCS, vol. 14084, pp. 731\u2013764. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_23","DOI":"10.1007\/978-3-031-38551-3_23"},{"key":"12_CR10","unstructured":"Feige, U., Lapidot, D., Shamir, A.: Multiple non-interactive zero knowledge proofs based on a single random string (extended abstract). In: 31st FOCS, pp. 308\u2013317. IEEE Computer Society Press, October 1990"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Fortnow, L.: The complexity of perfect zero-knowledge (extended abstract). In: Aho, A. (ed.) 19th ACM STOC, pp. 204\u2013209. ACM Press, May 1987","DOI":"10.1145\/28395.28418"},{"key":"12_CR12","unstructured":"Giacomelli, I., Madsen, J., Orlandi, C.: Zkboo: faster zero-knowledge for Boolean circuits. In: Holz, T., Savage, S. (eds.) 25th USENIX Security Symposium, USENIX Security 16, Austin, TX, USA, 10\u201312 August 2016, pp. 1069\u20131083. USENIX Association (2016)"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: 18th ACM STOC, pp. 59\u201368. ACM Press, May 1986","DOI":"10.1145\/12130.12137"},{"key":"12_CR14","unstructured":"Gur, T., O\u2019Connor, J., Spooner, N.: A zero-knowledge PCP theorem. CoRR, abs\/2411.07972 (2024)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge from secure multiparty computation. In: Johnson, D.S., Feige, U. (eds.) 39th ACM STOC, pp. 21\u201330. ACM Press, June 2007","DOI":"10.1145\/1250790.1250794"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/978-3-540-85174-5_32","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"Y Ishai","year":"2008","unstructured":"Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer \u2013 efficiently. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol. 5157, pp. 572\u2013591. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_32"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-54242-8_6","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2014","unstructured":"Ishai, Y., Weiss, M.: Probabilistically checkable proofs of proximity with zero-knowledge. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol. 8349, pp. 121\u2013145. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54242-8_6"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-77870-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"A Jain","year":"2021","unstructured":"Jain, A., Jin, Z.: Non-interactive zero knowledge from sub-exponential DDH. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 3\u201332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_1"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Kilian, J., Micali, S., Ostrovsky, R.: Minimum resource zero-knowledge proofs (extended abstract). In: 30th FOCS, pp. 474\u2013479. IEEE Computer Society Press, October\/November 1989","DOI":"10.1109\/SFCS.1989.63521"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Kilian, J., Petrank, E., Tardos, G.: Probabilistically checkable proofs with zero knowledge. In: 29th ACM STOC, pp. 496\u2013505. ACM Press, May 1997","DOI":"10.1145\/258533.258643"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1007\/978-3-030-26954-8_22","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"A Lombardi","year":"2019","unstructured":"Lombardi, A., Quach, W., Rothblum, R.D., Wichs, D., Wu, D.J.: New constructions of reusable designated-verifier NIZKs. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 670\u2013700. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_22"},{"key":"12_CR23","unstructured":"Micali, S.: A secure and efficient digital signature algorithm. Technical Memo MIT\/LCS\/TM-501b, Massachusetts Institute of Technology, Laboratory for Computer Science, April 1994"},{"key":"12_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/978-3-030-26948-7_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"C Peikert","year":"2019","unstructured":"Peikert, C., Shiehian, S.: Noninteractive zero knowledge for NP from (plain) learning with errors. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11692, pp. 89\u2013114. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26948-7_4"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Waters, B.: A new approach for non-interactive zero-knowledge from learning with errors. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, 24\u201328 June 2024, pp. 399\u2013410. ACM (2024)","DOI":"10.1145\/3618260.3649683"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-91134-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T11:04:45Z","timestamp":1745665485000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-91134-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031911330","9783031911347"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-91134-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"27 April 2025","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"4 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurocrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/eurocrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}