Metraipolis › archive › dc_2c3c33e216bf
The Power of Interaction in Locally Edge-Private Subgraph Counting — arXiv:2611.05038
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.05038
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-04T18:52:41.596Z
- SHA-256 of the archived text
2aff46b55a5a7df7bb105b21d6cf931135880bda75e4344a8e04085243e773ae- Stable URL of this page
https://metraipolis.com/documento/dc_2c3c33e216bf
How to cite
The Power of Interaction in Locally Edge-Private Subgraph Counting — arXiv:2611.05038 — arXiv (en), https://arxiv.org/abs/2611.05038 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2c3c33e216bf (Metraipolis archive dc_2c3c33e216bf, sha256 2aff46b55a5a7df7bb105b21d6cf931135880bda75e4344a8e04085243e773ae)
BibTeX
@misc{dc2c3c33e216bf,
title = {The Power of Interaction in Locally Edge-Private Subgraph Counting — arXiv:2611.05038},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.05038},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2c3c33e216bf; sha256 2aff46b55a5a7df7bb105b21d6cf931135880bda75e4344a8e04085243e773ae},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.05038. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study (non-induced) subgraph counting under interactive local edge differential privacy (LEDP). Given a fixed pattern graph $H$ with $k$ vertices, $\ell\ge1$ edges, and $q$ connected components, our goal is to approximately count its copies in an arbitrary $n$-vertex undirected graph while preserving edge privacy. We give two complementary accuracy guarantees. First, for every $H$, we give Linear Noise Cancellation (LNC), a two-round $\varepsilon$-LEDP algorithm with additive error and root mean square error both $O(n^{k-3/2}/\varepsilon^\ell)$ on every $n$-vertex graph. For fixed sufficiently small $\varepsilon$, this improves the optimal noninteractive additive error for triangles by a factor of $\sqrt n$ and gives the same improvement in worst-case root mean square error for all cliques on at least three vertices. To our knowledge, this is the first separation between interactive and noninteractive LEDP subgraph counting, showing that a single additional round can improve worst-case accuracy polynomially. Second, we determine how accuracy improves when the graph has maximum degree at most a public bound $d$. Our Predict and Correct (PC) framework gives an $(\ell+2)$-round $\varepsilon$-LEDP algorithm with additive error $O(n^{q-1/2}d^{k-q-1}\log^{3\ell-2}n/\varepsilon^\ell)$. For connected patterns, its polynomial factor is $\sqrt n\,d^{k-2}$, giving sublinear error on constant-degree graphs at fixed privacy. We prove matching lower bounds in $n$ and $d$, up to logarithmic factors at fixed privacy, even under arbitrary interaction and approximate privacy with sufficiently small $\delta$. At $d=\Theta(n)$, the lower bound also establishes the optimality of LNC's dependence on $n$.
Tema degli esploratori: fiducia digitale e crittografia (elenco arXiv cs.CR, nuovi lavori del giorno).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2611.05038 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:35:07.144Z dalla pagina https://arxiv.org/list/cs.CR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).