arXiv (All)
open access
Tight Lower Bounds for Differentially Private Continual Counting
The Binary Tree Mechanism is a standard algorithm for differentially private continual counting, but its asymptotic optimality under pure differential privacy has remained unresolved since its introduction. We resolve this question. For fixed $0 < \varepsilon \le 1$, we prove asymptotically tight lo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Tight Lower Bounds for Differentially Private Continual Counting#965363
- Near-Optimal Generalized Private Testing#216744
- Universal Exponent-Two Degree Laws in Range-Renewal Networks#972226
- Differential Privacy Meets Fixed Parameter Tractability: Algorithms and Lower Bounds#1070005
- Fault-Tolerant Private Information Retrieval via Threshold Distributed Point Functions.#1091368
Record · ID 1034780
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive