Adversarially robust streaming algorithms via differential privacy

DOI10.1145/3556972MaRDI QIDQ6551258

Haim Kaplan, Yishay Mansour, Avinatan Hassidim, Yossi Matias, Uri Stemmer

Publication date: 6 June 2024

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

zbMATH Keywords

robustnessdifferential privacystreaming

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic counting algorithms for data base applications
• The space complexity of approximating the frequency moments
• Separating adaptive streaming from oblivious streaming using the bounded storage model
• Efficient algorithms for constructing \((1+\epsilon,\beta)\)-spanners in the distributed and streaming models
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Preserving Statistical Validity in Adaptive Data Analysis
• Sketching in Adversarial Environments
• Optimal approximations of the frequency moments of data streams
• An improved data stream summary: the count-min sketch and its applications
• Maintaining Stream Statistics over Sliding Windows
• Continuous Monitoring of l_p Norms in Data Streams
• A Framework for Adversarially Robust Streaming Algorithms
• On the complexity of differentially private data release
• Composable and versatile privacy via truncated CDP
• Algorithmic stability for adaptive data analysis
• How robust are linear sketches to adaptive inputs?
• Theory of Cryptography
• What's hot and what's not: tracking most frequent items dynamically
• Adversarially robust streaming via dense-sparse trade-offs

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