Securing dynamic data: a primer on differentially private data structures (invited talk)

DOI10.4230/LIPICS.ESA.2025.2MaRDI QIDQ7322386zbMATH OpenFDO

Authors Monika R. Henzinger, Roodabeh Safavi

Publication date 31 August 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ESA.2025.2

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A unifying framework for differentially private sums under continual observation
• Almost tight error bounds on differentially private continual counting
• Boosting and differential privacy
• Concurrent composition of differential privacy
• Concurrent Composition Theorems for Differential Privacy
• Continuous monitoring of distributed data streams over a time-based sliding window
• Differential privacy under continual observation
• Differentially private Continual releases of streaming frequency moment estimations
• Differentially private release and learning of threshold functions
• scientific article; zbMATH DE number 7740897 (Why is no real title available?)
• Title not available (Why is no real title available?)
• Title not available (Why is no real title available?)
• On the complexity of differentially private data release, efficient algorithms and hardness results
• Private counting of distinct elements in the turnstile model and extensions
• The algorithmic foundations of differential privacy
• Theory of Cryptography

This page was built for publication: Securing dynamic data: a primer on differentially private data structures (invited talk)

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