Skip to content
Open access

CoP: Coordinated Perturbation for Controlled Disclosure Under Local Differential Privacy

Oct 2026 · Proceedings on Privacy Enhancing Technologies · Vol 2026, pp. 793-813 · 0 citations · 44 references
Computer Science

TL;DR

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.

Abstract

Collecting multidimensional user data is essential for personalized services, yet it poses significant privacy risks. While privacy regulations like the GDPR and CPRA advocate for data minimization, attribute correlations can inadvertently amplify unintentional information disclosure, leading to correlation-induced information leakage (CIL). Although data collectors often possess rich prior knowledge of these correlations, existing Local Differential Privacy (LDP) mechanisms are inadequate for effectively leveraging this information to reduce CIL. In this paper, we propose CoP, a coordinated perturbation mechanism designed to mitigate CIL in multidimensional data collection while preserving utility. Unlike traditional LDP approaches, CoP explicitly incorporates prior distribution knowledge to coordinate the perturbation process across attributes. By optimizing the perturbation strategy based on known correlations, CoP achieves a better privacy-utility trade-off. Extensive evaluations across both synthetic and real-world datasets demonstrate that CoP significantly outperforms state-of-the-art LDP mechanisms in reducing disclosure while preserving analytical accuracy.

Read PDF

Similar papers

Preprint Aug 2026

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

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.

Sandaru Jayawardana, S. Ulukus, Ming Ding et al. · 0 citations
Jul 2026

Federated Matrix Factorization under Local Differential Privacy via Directional Noise

Federated Recommender Systems (FRSs) enable on-device personalization while preserving user privacy, yet the gradients shared during model training can still leak sensitive information. Local differential privacy (LDP) offers a formal defense, but classic mechanisms—randomized response and Laplace perturbation—inject s...

Nawfal Abbassi Saber, Loubna Mekouar, Youssef Iraqi · 0 citations
#artificial intelligence Preprint Aug 2026

Performative Privacy: When Differential Privacy Maximizes Utility

It is shown, through a theoretical study of the dynamics and numerical experiments, that a finite privacy budget can outperform non-private estimation in the long term when the feedback loop between leakage and participation is sufficiently strong.

Uddalak Mukherjee, Edwige Cyffers, Y. Chevaleyre · 0 citations
Jul 2026

Toward Personalized Differentially Private Learning for Decentralized Local Graphs

PPGNN, a personalized differentially private framework for decentralized graph data, enables user-specific privacy budgets during local perturbation while preserving analytical utility in decentralized graph learning scenarios.

Longzhu He, Peng Tang, Chaozhuo Li et al. · 0 citations
Book Open access Aug 2026

Learning in the Right Subspace: Personalized Differential Private Federated Learning with Noise Filtering

Differential privacy (DP) mechanisms have been widely adopted in federated learning (FL) to enhance model security. However, existing approaches predominantly employ uniform privacy budgets, neglecting personalized requirements arising from heterogeneous user privacy preferences. Such uniform privacy configurations typ...

Tianchi Liao, Xiaojun Deng, Lele Fu 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

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