Skip to content
Preprint

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

Aug 2026 · 0 citations · 49 references
Computer Science Mathematics

TL;DR

A novel metric, ``Dependency Triad''(DT), is proposed, which summarizes the pairwise dependency information relevant to CPL using three parameters and yields a conservative estimator of pairwise CPL, which is particularly suitable for high-cardinality attributes.

Abstract

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.

View source

Similar papers

Open access Oct 2026

CoP: Coordinated Perturbation for Controlled Disclosure Under Local Differential Privacy

CoP is proposed, a coordinated perturbation mechanism designed to mitigate CIL in multidimensional data collection while preserving utility and significantly outperforms state-of-the-art LDP mechanisms in reducing disclosure while preserving analytical accuracy.

Sandaru Jayawardana, Ming Ding, Kanchana Thilakarathna · 0 citations
Conference Open access 2026

From Privacy-Utility Trade-Offs to Policies: Optimized Anonymization Recommendations for Data Trustees in Data Spaces

By mapping spatial transformation algorithms to ODRL constraints, this research provides data trustees with an approach to automatically enforce spatial privacy and sovereignty within data spaces.

Michael Steinert, Bekzod Nazarov, Thorsten Reitz et al. · 0 citations
Preprint Aug 2026

Beyond Direct Identifiers: Probabilistic Privacy Risk Estimation for Privacy-Conscious LLM Query Delegation

This work investigates a probabilistic variant of PCD, where an LLM-driven probabilistic estimation of k-anonymity is augmented with an LLM-driven probabilistic estimation of k-anonymity, and proposes k-anonymity as a useful auxiliary metric for tackling PCD.

Si-Yan Li, Yu Zhou, Julia Hirschberg · 2 citations
Jul 2026

DPEI: Privacy Budget Savings for Edge Information Protection in Synthetic Graph Publishing

With the widespread adoption of graph-structured data, protecting the complex relational information between nodes and edges while preventing sensitive information leakage has become a critical challenge. However, existing edge protection methods either introduce noise directly into the adjacency matrix, resulting in s...

Ruizhong Du, Zi-Zhan Wei, Mingyue Li · 0 citations
Jul 2026

Can We Explain What We Anonymize? On the Impact of Data Anonymization on Post-hoc Model Explanations

Privacy-preserving data publishing and explainable artificial intelligence (XAI) are both essential for trustworthy machine learning, yet their interaction remains largely underexplored. In practice, models are often trained on anonymized datasets, but little is known about how classical anonymization techniques affect...

Casper Lauge Nørup Koch, Mina Alishahi, Gaurav Choudhary · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.