Data synthesis is a promising solution to share data for various downstream analytic tasks without exposing raw data. However, without a theoretical privacy guarantee, a synthetic dataset would still leak some sensitive information. Differential privacy is thus widely adopted to safeguard data synthesis by strictly limiting the released information. This technique is advantageous yet presents significant challenges in the vertical federated setting, where data attributes are distributed among different data parties. The main challenge lies in maintaining privacy while efficiently and precisely reconstructing the correlation among cross-party attributes. In this paper, we propose a novel algorithm called VertiMRF, designed explicitly for generating synthetic data in the vertical setting and providing differential privacy protection for all information shared from data parties. We introduce techniques based on the Flajolet-Martin sketch (or frequency oracle) for encoding local data satisfying differential privacy and estimating cross-party marginals. We provide theoretical privacy and utility proof for encoding in this multi-attribute data. Collecting the locally generated private Markov Random Field (MRF) and the sketches, a central server can reconstruct a global MRF, maintaining the most useful information. Additionally, we introduce two techniques tailored for datasets with large attribute domain sizes, namely dimension reduction and consistency enforcement. These two techniques allow flexible and inconsistent binning strategies of local private MRF and the data sketching module, which can preserve information to the greatest extent. We conduct extensive experiments on four real-world datasets to evaluate the effectiveness of VertiMRF. End-to-end comparisons demonstrate the superiority of VertiMRF, and ablation studies validate the effectiveness of each component.
A Simple Differentially Private Algorithm for Global Minimum Cut
在这篇文章中,我们提出了一个简单的差分私有算法的全球最小割问题,只使用一个调用的指数机制。这个问题首先由Gupta等人研究。[2010],他们给出了一个具有接近最优效用保证的差分私有算法。我们在许多方面改进了他们的工作:我们的算法比Gupta et al. [2010]中给出的算法更简单,更自然,更有效,而且提供了更好的隐私和实用性保证。
Differentially Private Algorithms for Clustering with Stability Assumptions
Ben-Gurion University of the Negev(内盖夫本-古里安大学)
本文研究了在输入稳定性假设下的差分私有聚类问题。尽管关于差分隐私的研究越来越多,特别是关于差异隐私聚类的研究,但只有三项研究(Nissim et al. 2007,Wang et al. 2015,Huang et al. 2018)研究了私下聚类“好”k均值实例的问题,这三个都依赖于样本,聚合框架和所有三个测量实用程序在真正的集群中心和返回的中心之间的Wasserstein距离私有算法在这项工作中,我们改进了这一系列的多轴工作。我们提出了一个简单得多的算法聚类稳定的输入(不依赖于样本和聚合框架),并分析其效用的Wasserstein距离和k-means成本。此外,我们的算法有直接的类似物“好”的k-中位数的实例和本地模型的差分隐私。