Adversarially robust streaming algorithms via differential privacy

DOI10.1145/3556972MaRDI QIDQ6551258zbMATH OpenFDO

Authors Avinatan Hassidim, Haim Kaplan, Yishay Mansour, Y. Matias, Uri Stemmer

Publication date 6 June 2024

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3556972

zbMATH Keywords

differential privacyrobustnessstreaming

Mathematics Subject Classification ID

Privacy of data (68P27) Online algorithms; streaming algorithms (68W27)

Recommendations

• A Framework for Adversarially Robust Streaming Algorithms
• The algorithmic foundations of differential privacy
• Differential privacy and robust statistics
• Privacy-preserving statistical estimation with optimal convergence rates
• Differential privacy in new settings

Cites work

• A Framework for Adversarially Robust Streaming Algorithms
• Adversarially robust streaming via dense-sparse trade-offs
• Algorithmic stability for adaptive data analysis
• An improved data stream summary: the count-min sketch and its applications
• Composable and versatile privacy via truncated CDP
• Continuous monitoring of _p norms in data streams
• Data streams: algorithms and applications.
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
• How robust are linear sketches to adaptive inputs?
• scientific article; zbMATH DE number 5485440 (Why is no real title available?)
• scientific article; zbMATH DE number 2019620 (Why is no real title available?)
• scientific article; zbMATH DE number 2086663 (Why is no real title available?)
• scientific article; zbMATH DE number 7053292 (Why is no real title available?)
• Maintaining Stream Statistics over Sliding Windows
• On the complexity of differentially private data release, efficient algorithms and hardness results
• On the exact space complexity of sketching and streaming small norms
• Optimal approximations of the frequency moments of data streams
• Preserving statistical validity in adaptive data analysis (extended abstract)
• Private learning and sanitization: pure vs. approximate differential privacy
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Probabilistic counting algorithms for data base applications
• Separating adaptive streaming from oblivious streaming using the bounded storage model
• Sketching in Adversarial Environments
• The space complexity of approximating the frequency moments
• Theory of Cryptography
• What's hot and what's not: tracking most frequent items dynamically

Cited in

(1)

• A Framework for Adversarially Robust Streaming Algorithms

This page was built for publication: Adversarially robust streaming algorithms via differential privacy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551258)