{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:36:52Z","timestamp":1766281012922,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030842512"},{"type":"electronic","value":"9783030842529"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-84252-9_4","type":"book-chapter","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:04:26Z","timestamp":1628636666000},"page":"94-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Separating Adaptive Streaming from Oblivious Streaming Using the Bounded Storage Model"],"prefix":"10.1007","author":[{"given":"Haim","family":"Kaplan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yishay","family":"Mansour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Stemmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,11]]},"reference":[{"key":"4_CR1","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Analyzing graph structure via linear measurements. In: Rabani, Y. (ed.) Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2012, Kyoto, Japan, 17\u201319 January 2012, pp. 459\u2013467. SIAM (2012)"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: Benedikt, M., Kr\u00f6tzsch, M., Lenzerini, M. (eds.) Proceedings of the 31st ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2012, Scottsdale, AZ, USA, 20\u201324 May 2012, pp. 5\u201314. ACM (2012)","DOI":"10.1145\/2213556.2213560"},{"issue":"6","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TIT.2002.1003845","volume":"48","author":"Y Aumann","year":"2002","unstructured":"Aumann, Y., Ding, Y.Z., Rabin, M.O.: Everlasting security in the bounded storage model. IEEE Trans. Inf. Theory 48(6), 1668\u20131680 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-48405-1_5","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"Y Aumann","year":"1999","unstructured":"Aumann, Y., Rabin, M.O.: Information theoretically secure communication in the limited storage space model. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 65\u201379. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_5"},{"key":"4_CR5","unstructured":"Bassily, R., Nissim, K., Smith, A.D., Steinke, T., Stemmer, U., Ullman, J.: Algorithmic stability for adaptive data analysis. In: Wichs, D., Mansour, Y. (eds.) Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, 18\u201321 June 2016, pp. 1046\u20131059. ACM (2016)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Eliezer, O., Jayaram, R., Woodruff, D.P., Yogev, E.: A framework for adversarially robust streaming algorithms. CoRR, abs\/2003.14265 (2020)","DOI":"10.1145\/3375395.3387658"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Eliezer, O., Yogev, E.: The adversarial robustness of sampling. CoRR, abs\/1906.11327 (2019)","DOI":"10.1145\/3375395.3387643"},{"key":"4_CR8","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":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45841-7_1","volume-title":"STACS 2002","author":"YZ Ding","year":"2002","unstructured":"Ding, Y.Z., Rabin, M.O.: Hyper-encryption and everlasting security. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, pp. 1\u201326. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_1"},{"key":"4_CR10","unstructured":"Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., Roth, A.: Generalization in adaptive data analysis and holdout reuse. In: Advances in Neural Information Processing Systems (NIPS), Montreal, December 2015 (2015)"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Feldman, V., Hardt, M., Pitassi, T., Reingold, O., Roth, A.: Preserving statistical validity in adaptive data analysis. In: ACM Symposium on the Theory of Computing (STOC), June 2015. ACM (2015)","DOI":"10.1145\/2746539.2746580"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s00145-003-0309-y","volume":"17","author":"S Dziembowski","year":"2004","unstructured":"Dziembowski, S., Maurer, U.: Optimal randomizer efficiency in the bounded-storage model. J. Cryptol. 17(1), 5\u201326 (2004)","journal-title":"J. Cryptol."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Hemenway, B., Rudra, A., Strauss, M.J., Wootters, M.: Recovering simple signals. In: 2012 Information Theory and Applications Workshop, pp. 382\u2013391 (2012)","DOI":"10.1109\/ITA.2012.6181772"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Hemenway, B., Strauss, M.J., Woodruff, D.P., Wootters, M.: Reusable low-error compressive sampling schemes through privacy. In: 2012 IEEE Statistical Signal Processing Workshop (SSP), pp. 536\u2013539 (2012)","DOI":"10.1109\/SSP.2012.6319752"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Hardt, M., Ullman, J.: Preventing false discovery in interactive data analysis is hard. In: FOCS, 19\u201321 October 2014. IEEE (2014)","DOI":"10.1109\/FOCS.2014.55"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Hardt, M., Woodruff, D.P.: How robust are linear sketches to adaptive inputs? In STOC, 1\u20134 June 2013, pp. 121\u2013130. ACM (2013)","DOI":"10.1145\/2488608.2488624"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/11787006_17","volume-title":"Automata, Languages and Programming","author":"D Harnik","year":"2006","unstructured":"Harnik, D., Naor, M.: On everlasting security in the hybrid bounded storage model. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 192\u2013203. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11787006_17"},{"key":"4_CR18","unstructured":"Hassidim, A., Kaplan, H., Mansour, Y., Matias, Y., Stemmer, U.: Adversarially robust streaming algorithms via differential privacy. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, 6\u201312 December 2020, virtual (2020)"},{"issue":"1","key":"4_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00145-003-0217-1","volume":"17","author":"C-J Lu","year":"2004","unstructured":"Lu, C.-J.: Encryption against storage-bounded adversaries from on-line strong extractors. J. Cryptol. 17(1), 27\u201342 (2004)","journal-title":"J. Cryptol."},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF00191321","volume":"5","author":"UM Maurer","year":"1992","unstructured":"Maurer, U.M.: Conditionally-perfect secrecy and a provably-secure randomized cipher. J. Cryptol. 5(1), 53\u201366 (1992)","journal-title":"J. Cryptol."},{"issue":"6","key":"4_CR21","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1137\/080733772","volume":"40","author":"I Mironov","year":"2011","unstructured":"Mironov, I., Naor, M., Segev, G.: Sketching in adversarial environments. SIAM J. Comput. 40(6), 1845\u20131870 (2011)","journal-title":"SIAM J. Comput."},{"key":"4_CR22","unstructured":"Nissim, K., Smith, A.D., Steinke, T., Stemmer, U., Ullman, J.: The limits of post-selection generalization. In: Bengio, S., Wallach, H.M., Larochelle, H., Grauman, K., Cesa-Bianchi, N., Garnett, R. (eds.) Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, NeurIPS 2018, Canada, Montr\u00e9al, 3\u20138 December 2018, pp. 6402\u20136411 (2018)"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Steinke, T., Ullman, J.: Interactive fingerprinting codes and the hardness of preventing false discovery. In: COLT, pp. 1588\u20131628 (2015)","DOI":"10.1109\/ITA.2016.7888199"},{"issue":"1","key":"4_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00145-003-0237-x","volume":"17","author":"SP Vadhan","year":"2004","unstructured":"Vadhan, S.P.: Constructing locally computable extractors and cryptosystems in the bounded-storage model. J. Cryptol. 17(1), 43\u201377 (2004)","journal-title":"J. Cryptol."},{"issue":"1","key":"4_CR25","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter, J.S.: Random sampling with a reservoir. ACM Trans. Math. Softw. 11(1), 37\u201357 (1985)","journal-title":"ACM Trans. Math. Softw."},{"key":"4_CR26","unstructured":"Woodruff, D.P., Zhou, S.:. Tight bounds for adversarially robust streams and sliding windows via difference estimators. CoRR, abs\/2011.07471 (2020)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-84252-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,11]],"date-time":"2024-08-11T00:08:22Z","timestamp":1723334902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-84252-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030842512","9783030842529"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-84252-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 August 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"41","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"426","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1 invited paper is also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}