Separating adaptive streaming from oblivious streaming using the bounded storage model

DOI10.1007/978-3-030-84252-9_4OpenAlexW3191101401MaRDI QIDQ2128990

Kobbi Nissim, Uri Stemmer, Yishay Mansour, Haim Kaplan

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_4

zbMATH Keywords

bounded storage modeladversarially-robust streamingseparation from oblivious streaming

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Cryptography (94A60) Theory of data (68Pxx) Informational aspects of data analysis and big data (94A16)

Related Items (3)

A Framework for Adversarially Robust Streaming Algorithms ⋮ Mirror games against an open book player ⋮ Bet-or-pass: adversarially robust Bloom filters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Optimal randomizer efficiency in the bounded-storage model
• Encryption against storage-bounded adversaries from on-line strong extractors
• Constructing locally computable extractors and cryptosystems in the bounded-storage model
• Preserving Statistical Validity in Adaptive Data Analysis
• The reusable holdout: Preserving validity in adaptive data analysis
• Sketching in Adversarial Environments
• On Everlasting Security in the Hybrid Bounded Storage Model
• Random sampling with a reservoir
• Everlasting security in the bounded storage model
• Algorithmic stability for adaptive data analysis
• How robust are linear sketches to adaptive inputs?

This page was built for publication: Separating adaptive streaming from oblivious streaming using the bounded storage model