{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:58:43Z","timestamp":1743112723292,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780165"},{"type":"electronic","value":"9783031780172"}],"license":[{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"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-78017-2_13","type":"book-chapter","created":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:15:22Z","timestamp":1732752922000},"page":"371-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Doubly-Efficient Batch Verification in\u00a0Statistical Zero-Knowledge"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9870-5285","authenticated-orcid":false,"given":"Or","family":"Keret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5481-7276","authenticated-orcid":false,"given":"Ron D.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6880-795X","authenticated-orcid":false,"given":"Prashant Nalini","family":"Vasudevan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00145-015-9214-4","volume":"30","author":"G Asharov","year":"2017","unstructured":"Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly secure multiparty computation. J. Cryptol. 30(1), 58\u2013151 (2017)","journal-title":"J. Cryptol."},{"issue":"6","key":"13_CR2","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1137\/0220068","volume":"20","author":"M Blum","year":"1991","unstructured":"Blum, M., De Santis, A., Micali, S., Persiano, G.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084\u20131118 (1991)","journal-title":"SIAM J. Comput."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon, J. (eds.) Proceedings of the 20th Annual ACM Symposium on Theory of Computing, May 2\u20134, 1988, Chicago, Illinois, USA, pp. 1\u201310. ACM (1988)","DOI":"10.1145\/62212.62213"},{"key":"13_CR4","unstructured":"Bitansky, N., Kamath, C., Paneth, O., Rothblum, R., Vasudevan, P.N.: Batch proofs are statistically hiding. Electron. Colloquium Comput. Complex., TR23-077 (2023)"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Micali, S., Ostrovsky, R.M.: Perfect zero-knowledge in constant rounds. In: Symposium on the Theory of Computing (1990)","DOI":"10.1145\/100216.100283"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/0-387-34799-2_4","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 88","author":"M Ben-Or","year":"1990","unstructured":"Ben-Or, M., et al.: Everything provable is provable in zero-knowledge. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 37\u201356. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_4"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00145-006-0438-1","volume":"20","author":"YZ Ding","year":"2007","unstructured":"Ding, Y.Z., Harnik, D., Rosen, A., Shaltiel, R.: Constant-round oblivious transfer in the bounded storage model. J. Cryptol. 20, 165\u2013202 (2007)","journal-title":"J. Cryptol."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/BFb0055102","volume-title":"Automata, Languages and Programming","author":"A De Santis","year":"1998","unstructured":"De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: Image density is complete for non-interactive-SZK. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 784\u2013795. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0055102"},{"key":"13_CR9","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":"13_CR10","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Micciancio, T., Rabin, D.: An efficient non-interactive statistical zero-knowledge proof system for quasi-safe prime products. In: 5th ACM Conference on Computer and Communication Security (CCS\u201998), pp. 67\u201372, San Francisco, California, November 1998. ACM, ACM Press (1998)","DOI":"10.1145\/288090.288108"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity for all languages in NP have zero-knowledge proof systems. J. ACM 38(3), 691\u2013729 (1991)","journal-title":"J. ACM"},{"issue":"1","key":"13_CR12","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."},{"issue":"3","key":"13_CR13","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1561\/0400000084","volume":"13","author":"O Goldreich","year":"2018","unstructured":"Goldreich, O.: On doubly-efficient interactive proof systems. Found. Trends Theor. Comput. Sci. 13(3), 158\u2013246 (2018)","journal-title":"Found. Trends Theor. Comput. Sci."},{"key":"13_CR14","unstructured":"Gur, T., Rothblum, R.D.: A hierarchy theorem for interactive proofs of proximity. In: Papadimitriou, C.H. (ed.) 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, January 9-11, 2017, Berkeley, CA, USA, vol.\u00a067, LIPIcs, pp. 39:1\u201339:43. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/3-540-48405-1_30","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"O Goldreich","year":"1999","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Can statistical zero knowledge be made non-interactive? or on the relationship of SZK and NISZK. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 467\u2013484. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_30"},{"key":"13_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-48615-9_1","volume-title":"TCC 2023","author":"C Hazay","year":"2023","unstructured":"Hazay, C., Venkitasubramaniam, M., Weiss, M.: Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs. In: Rothblum, G., Wee, H. (eds.) TCC 2023. LNCS, vol. 14369, pp. 3\u201333. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-48615-9_1"},{"issue":"3","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1137\/080725398","volume":"39","author":"Y Ishai","year":"2009","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R., Sahai, A.: Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39(3), 1121\u20131152 (2009)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s001459900018","volume":"10","author":"T Itoh","year":"1997","unstructured":"Itoh, T., Ohta, Y., Shizuya, H.: A language-dependent cryptographic primitive. J. Cryptol. 10(1), 37\u201349 (1997). https:\/\/doi.org\/10.1007\/s001459900018","journal-title":"J. Cryptol."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments (extended abstract). In: Kosaraju, S.R., Fellows, M., Wigderson, A., Ellis, A.J. (eds.) Proceedings of the 24th Annual ACM Symposium on Theory of Computing, May 4-6, 1992, Victoria, British Columbia, Canada, pp. 723\u2013732. ACM (1992)","DOI":"10.1145\/129712.129782"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-030-64378-2_6","volume-title":"Theory of Cryptography","author":"I Kaslasi","year":"2020","unstructured":"Kaslasi, I., Rothblum, G.N., Rothblum, R.D., Sealfon, A., Vasudevan, P.N.: Batch verification for statistical zero knowledge proofs. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 139\u2013167. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_6"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-030-77883-5_8","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"I Kaslasi","year":"2021","unstructured":"Kaslasi, I., Rothblum, R.D., Vasudevanr, P.N.: Public-coin statistical zero-knowledge batch verification against malicious verifiers. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12698, pp. 219\u2013246. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77883-5_8"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Mu, C., Nassar, S., Rothblum, R., Vasudevan, P.N.: Strong batching for non-interactive statistical zero-knowledge. Electron. Colloquium Comput. Complex. TR24\u2013024 (2024)","DOI":"10.1007\/978-3-031-58751-1_9"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s001459900037","volume":"11","author":"M Naor","year":"1998","unstructured":"Naor, M., Ostrovsky, R., Venkatesan, R., Yung, M.: Perfect zero-knowledge arguments for NP using any one-way permutation. J. Cryptol. 11, 87\u2013108 (1998)","journal-title":"J. Cryptol."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Nguyen, M.-H., Vadhan, S.: Zero knowledge with efficient provers. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 287\u2013295 (2006)","DOI":"10.1145\/1132516.1132559"},{"key":"13_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-78524-8_27","volume-title":"Theory of Cryptography","author":"SJ Ong","year":"2008","unstructured":"Ong, S.J., Vadhan, S.: An equivalence between zero knowledge and commitments. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 482\u2013500. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_27"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-030-64378-2_5","volume-title":"Theory of Cryptography","author":"GN Rothblum","year":"2020","unstructured":"Rothblum, G.N., Rothblum, R.D.: Batch verification and proofs of proximity with polylog overhead. In: Pass, R., Pietrzak, K. (eds.) TCC 2020. LNCS, vol. 12551, pp. 108\u2013138. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64378-2_5"},{"key":"13_CR27","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Efficient batch verification for UP. In: Servedio, R.A. (eds.) 33rd Computational Complexity Conference, CCC 2018, June 22\u201324, 2018, San Diego, CA, USA, volume 102 of LIPIcs, pp. 22:1\u201322:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Reingold, O., Rothblum, G.N., Rothblum, R.D.: Constant-round interactive proofs for delegating computation. SIAM J. Comput. 50(3) (2021)","DOI":"10.1137\/16M1096773"},{"key":"13_CR29","doi-asserted-by":"crossref","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.) Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, June 1-4, 2013, pp. 793\u2013802. ACM (2013)","DOI":"10.1145\/2488608.2488709"},{"key":"13_CR30","unstructured":"Renner, R., Wolf, S.: Smooth R\u00e9nyi entropy and applications. In: International Symposium on Information Theory, 2004. ISIT 2004. Proceedings, p. 233. IEEE (2004)"}],"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-78017-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:17:23Z","timestamp":1732753043000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78017-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,28]]},"ISBN":["9783031780165","9783031780172"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78017-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,28]]},"assertion":[{"value":"28 November 2024","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":"Milan","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}