REVIEW 2 cited by
A Framework for Adversarial Streaming via Differential Privacy and Difference Estimators
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Classical streaming algorithms operate under the (not always reasonable) assumption that the input stream is fixed in advance. Recently, there is a growing interest in designing robust streaming algorithms that provide provable guarantees even when the input stream is chosen adaptively as the execution progresses. We propose a new framework for robust streaming that combines techniques from two recently suggested frameworks by Hassidim et al. [NeurIPS 2020] and by Woodruff and Zhou [FOCS 2021]. These recently suggested frameworks rely on very different ideas, each with its own strengths and weaknesses. We combine these two frameworks into a single hybrid framework that obtains the ``best of both worlds'', thereby solving a question left open by Woodruff and Zhou.
Forward citations
Cited by 2 Pith papers
-
Breaking the Quadratic Barrier: Robust Cardinality Sketches for Adaptive Queries
A fine-grained per-key analysis lets bottom-k cardinality sketches answer many adaptive queries when each key appears in few of them, shifting the quadratic barrier from total query count to per-key participation.
-
A Simple and Robust Protocol for Distributed Counting
An adaptive attack defeats the HYZ12 distributed counting protocol, and a simplified round-based sampling protocol achieves optimal communication with white-box robustness.
Discussion (0). Continue with ORCID to comment.