{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:46:24Z","timestamp":1757627184953,"version":"3.44.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019066"},{"type":"electronic","value":"9783032019073"}],"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-032-01907-3_18","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:38Z","timestamp":1755383258000},"page":"548-579","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Zero-Knowledge in\u00a0Streaming Interactive Proofs"],"prefix":"10.1007","author":[{"given":"Tomer","family":"Gewirtzman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001, 14\u201317 October 2001, Las Vegas, Nevada, USA, pp. 106\u2013115. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959885"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-319-70503-3_6","volume-title":"Theory of Cryptography","author":"E Ben-Sasson","year":"2017","unstructured":"Ben-Sasson, E., Chiesa, A., Forbes, M.A., Gabizon, A., Riabzev, M., Spooner, N.: Zero knowledge protocols from succinct constraint detection. In: Kalai, Y., Reyzin, L. (eds.) TCC 2017, Part II. LNCS, vol. 10678, pp. 172\u2013206. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70503-3_6"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Cachin, C., Cr\u00e9peau, C., Marcil, J.: Oblivious transfer with a memory-bounded receiver. In: Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No. 98CB36280), pp. 493\u2013502. IEEE (1998)","DOI":"10.1109\/SFCS.1998.743500"},{"key":"18_CR4","unstructured":"Chakrabarti, A., Cormode, G., McGregor, A., Thaler, J., Venkatasubramanian, S.: Verifiable stream computation and Arthur-Merlin communication. In: Leibniz International Proceedings in Informatics (LIPIcs), pp. 217\u2013243 (2015)"},{"issue":"4","key":"18_CR5","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1137\/17M112289X","volume":"48","author":"A Chakrabarti","year":"2019","unstructured":"Chakrabarti, A., Cormode, G., McGregor, A., Thaler, J., Venkatasubramanian, S.: Verifiable stream computation and Arthur-Merlin communication. SIAM J. Comput. 48(4), 1265\u20131299 (2019)","journal-title":"SIAM J. Comput."},{"key":"18_CR6","unstructured":"Cormode, G., Dall\u2019Agnol, M., Gur, T., Hickey, C.: Streaming zero-knowledge proofs. In: 39th Computational Complexity Conference, CCC 2024, p. 2. Dagstuhl Publishing, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH (2024)"},{"key":"18_CR7","unstructured":"Chiesa, A., Forbes, M.A., Spooner, N.: A zero knowledge sumcheck and its applications. arXiv preprint arXiv:1704.02086 (2017)"},{"key":"18_CR8","unstructured":"Chakrabarti, A., Ghosh, P., Thaler, J.: Streaming verification for graph problems: optimal tradeoffs and nonlinear sketches. arXiv preprint arXiv:2007.03039 (2020)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201997","author":"C Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.: Unconditional security against memory-bounded adversaries. In: Kaliski, B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 292\u2013306. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052243"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Practical verified computation with streaming interactive proofs. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 90\u2013112 (2012)","DOI":"10.1145\/2090236.2090245"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Cormode, G., Thaler, J., Yi, K.: Verifying computations with streaming interactive proofs. Proc. VLDB Endow. 5(1) (2011)","DOI":"10.14778\/2047485.2047488"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/978-3-540-24638-1_25","volume-title":"Theory of Cryptography","author":"YZ Ding","year":"2004","unstructured":"Ding, Y.Z., Harnik, D., Rosen, A., Shaltiel, R.: Constant-round oblivious transfer in the bounded storage model. In: Naor, M. (ed.) TCC 2004. LNCS, vol. 2951, pp. 446\u2013472. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_25"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/3-540-44647-8_9","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"YZ Ding","year":"2001","unstructured":"Ding, Y.Z.: Oblivious transfer in the bounded storage model. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 155\u2013170. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_9"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-24676-3_8","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"S Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.: On generating the initial key in the bounded-storage model. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 126\u2013137. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_8"},{"key":"18_CR15","unstructured":"Dodis, Y., Quach, W., Wichs, D.: Speak much, remember little: cryptography in the bounded storage model. Technical report, revisited. Cryptology ePrint Archive, Report 2021\/1270 (2021)"},{"issue":"3","key":"18_CR16","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\u2013189 (1996). https:\/\/doi.org\/10.1007\/BF00208001","journal-title":"J. Cryptol."},{"issue":"4","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2699436","volume":"62","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for Muggles. J. ACM (JACM) 62(4), 1\u201364 (2015)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"18_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804106","volume-title":"Computational Complexity - A Conceptual Perspective","author":"O Goldreich","year":"2008","unstructured":"Goldreich, O.: Computational Complexity - A Conceptual Perspective. Cambridge University Press, Cambridge (2008)"},{"issue":"3","key":"18_CR20","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":"18_CR21","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.ic.2014.12.011","volume":"243","author":"T Gur","year":"2015","unstructured":"Gur, T., Raz, R.: Arthur-Merlin streaming complexity. Inf. Comput. 243, 145\u2013165 (2015)","journal-title":"Inf. Comput."},{"key":"18_CR22","unstructured":"Gewirtzman, T., Rothblum, R.: Zero-knowledge in streaming interactive proofs. Electron. Colloquium Comput. Complex. TR24-181 (2024)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-030-17659-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"J Guan","year":"2019","unstructured":"Guan, J., Zhandary, M.: Simple schemes in the bounded storage model. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 500\u2013524. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_17"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-36178-2_9","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2002","author":"D Hong","year":"2002","unstructured":"Hong, D., Chang, K.-Y., Ryu, H.: Efficient oblivious transfer in the bounded-storage model. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 143\u2013159. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36178-2_9"},{"issue":"4","key":"18_CR25","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"18_CR26","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 (1992)","DOI":"10.1145\/129712.129782"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-540-70583-3_44","volume-title":"Automata, Languages and Programming","author":"YT Kalai","year":"2008","unstructured":"Kalai, Y.T., Raz, R.: Interactive PCP. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 536\u2013547. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_44"},{"issue":"1","key":"18_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3186563","volume":"66","author":"R Raz","year":"2018","unstructured":"Raz, R.: Fast learning requires good memory: a time-space lower bound for parity learning. J. ACM (JACM) 66(1), 1\u201318 (2018)","journal-title":"J. ACM (JACM)"},{"key":"18_CR29","unstructured":"Vadhan, S.P.: A study of statistical zero-knowledge proofs. Ph.D. thesis, Massachusetts Institute of Technology (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01907-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T01:25:12Z","timestamp":1757467512000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","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":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}