Improved Lower Bounds for Privacy under Continual Release
Summary: Proves polynomial continual-release lower bounds for insertion-only graph statistics and simultaneous norm estimation, overturning the presumed insertion/deletion gap. Multiplicative slack restores polylogarithmic error, while new item-level product lower bounds follow via 1-Way-Marginals reductions. (summarized by gpt-5.6-luna on Jul 26 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Bardiya Aryanfard (Institute of Science and Technology Austria)
- 2. Monika Henzinger (Institute of Science and Technology Austria)
- 3. David Saulpic (National Centre for Scientific Research; Université Paris Cité)
- 4. A. R. Sricharan (University of Vienna)
BibTeX Citation
@inproceedings{aryanfard_pods26,
address = {New York, NY, USA},
series = {{PODS} '26},
title = {{Improved Lower Bounds for Privacy under Continual Release}},
url = {https://dl.acm.org/doi/10.1145/3801903},
doi = {10.1145/3801903},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Aryanfard, Bardiya and Henzinger, Monika and Saulpic, David and Sricharan, A. R.},
year = {2026}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 14 of 14 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,083 | Global and Local Differentially Private Release of Count-Weighted Graphs | 2023 | SIGMOD |
| 2 | 8,707 | Set-valued Data Publication with Local Privacy: Tight Error Bounds and Efficient Mechanisms | 2020 | VLDB |
| 3 | 11,370 | Node-Differentially Private Estimation of the Number of Connected Components | 2023 | PODS |
| 4 | 121 | Boosting the Accuracy of Differentially Private Histograms Through Consistency | 2010 | VLDB |
| 5 | 7,517 | Private Incremental Regression | 2017 | PODS |
| 6 | 10,157 | Improved Accuracy for Private Continual Cardinality Estimation in Fully Dynamic Streams via Matrix Factorization | 2026 | PODS |
| 7 | 9,538 | Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation | 2025 | PODS |
| 8 | 8,158 | Continual Observation of Joins under Differential Privacy | 2024 | SIGMOD |
| 9 | 10,150 | Concurrent Composition for Differentially Private Continual Mechanisms | 2026 | PODS |
| 10 | 6,826 | Fully Dynamic Algorithms for Graph Databases with Edge Differential Privacy | 2025 | PODS |