Metraipolis › archive › dc_a47cd684f2e8

Private Graph Property Testing — arXiv:2609.14394

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14394
License (as archived)
CC0-1.0
Archived
2026-10-15T23:54:12.709Z
SHA-256 of the archived text
9f3367742eb407b83a7934fe0f5a1df983ab1a6589208f9f94be0f2ddca66225
Stable URL of this page
https://metraipolis.com/documento/dc_a47cd684f2e8

How to cite

Private Graph Property Testing — arXiv:2609.14394 — arXiv (en), https://arxiv.org/abs/2609.14394 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a47cd684f2e8 (Metraipolis archive dc_a47cd684f2e8, sha256 9f3367742eb407b83a7934fe0f5a1df983ab1a6589208f9f94be0f2ddca66225)
BibTeX
@misc{dca47cd684f2e8,
  title = {Private Graph Property Testing — arXiv:2609.14394},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14394},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a47cd684f2e8; sha256 9f3367742eb407b83a7934fe0f5a1df983ab1a6589208f9f94be0f2ddca66225},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14394. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Graph property testing asks whether a massive graph satisfies a given property, or is far from doing so, using only a sublinear number of queries to the graph. Since property testers typically inspect only a small, randomly sampled portion of the input, they appear naturally compatible with differential privacy and privacy amplification by subsampling. Despite this, few results link these two fields. We initiate a systematic study of differentially private graph property testing with the goal of designing efficient testers with formal privacy guarantees in the dense and bounded-degree graph models. We develop new privacy amplification theorems for several widely used graph-sampling procedures such as induced subgraph sampling, random walks and k-disc sampling. We then leverage these privacy amplification techniques to design a private canonical tester in the dense graph model, as well as private bipartiteness testers and subgraph freeness testers in the dense and bounded-degree graph models. Finally, using the new privacy amplification theorem for k-disc sampling, we prove that every property of hyperfinite graphs is privately testable. The resulting query complexities of our private testers are comparable to those of their non-private counterparts.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-09-15 in cs.CR).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Cryptography and Security (cs.CR).
Pagina del lavoro: https://arxiv.org/abs/2609.14394 — 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-10-15T23:20:42.737Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).