Metraipolis › archive › dc_6836a709aaab

Dependency Triad: A Metric to Quantify the Dependencies Between Attributes for Local Differential Privacy — arXiv:2608.03737

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.03737
License (as archived)
CC0-1.0
Archived
2026-10-31T12:34:29.754Z
SHA-256 of the archived text
f2252d987ffe35b36fe43b64a04c090b6075d03673193527d3677c72db68397b
Stable URL of this page
https://metraipolis.com/documento/dc_6836a709aaab

How to cite

Dependency Triad: A Metric to Quantify the Dependencies Between Attributes for Local Differential Privacy — arXiv:2608.03737 — arXiv (en), https://arxiv.org/abs/2608.03737 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_6836a709aaab (Metraipolis archive dc_6836a709aaab, sha256 f2252d987ffe35b36fe43b64a04c090b6075d03673193527d3677c72db68397b)
BibTeX
@misc{dc6836a709aaab,
  title = {Dependency Triad: A Metric to Quantify the Dependencies Between Attributes for Local Differential Privacy — arXiv:2608.03737},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.03737},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_6836a709aaab; sha256 f2252d987ffe35b36fe43b64a04c090b6075d03673193527d3677c72db68397b},
  year = {2026}
}

Archived text

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

Collecting multidimensional user data is essential for extracting rich insights across various applications. Local Differential Privacy (LDP) has emerged as a de facto standard for mitigating privacy risks in such scenarios. A key challenge in privacy-preserving multidimensional data collection lies in inter-attribute dependencies, as they can inadvertently reveal correlated information and increase privacy vulnerabilities. Therefore, accurately measuring correlation-induced privacy leakage (CPL) is essential for privacy analysis and privacy-utility trade-off. However, existing CPL analysis solutions either require accurate prior knowledge or face scalability challenges for large numbers of attributes and high-cardinality attributes. These limit their practical applicability in real data. To address this research gap, we propose a novel metric, ``Dependency Triad'' (DT), which summarizes the pairwise dependency information relevant to CPL using three parameters and yields a \emph{constant-time} conservative estimator of pairwise CPL. DT explicitly models uncertainty in prior distributional knowledge through its parameters, delivering robust leakage estimates. Moreover, its robustness to sparse distributions makes it particularly suitable for high-cardinality attributes, while the pairwise formulation serves as a tractable building block for assessing total leakage in multidimensional settings. Extensive experiments on both synthetic and real datasets demonstrate that DT consistently estimates CPL across diverse dependency regimes and prior uncertainties.

Tema degli esploratori: fiducia digitale e crittografia (retro-catalogo arXiv: annunci del 2026-08-05 in cs.CR).
Categorie arXiv: Cryptography and Security (cs.CR) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.03737 — 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-31T12:21:50.568Z dalla pagina https://arxiv.org/catchup/cs.CR/2026-08-05?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).