arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.19008cs.DS
收藏

VertiMRF:差分隐私的纵向联邦数据合成

VertiMRF: Differentially Private Vertical Federated Data Synthesis

Fangyuan Zhao, Zitao Li, Xuebin Ren, Bolin Ding, Shusen Yang, Yaliang Li

AI总结:

针对纵向联邦设置下数据合成的隐私与跨方属性相关性重建难题,提出差分隐私算法VertiMRF,结合Flajolet-Martin sketch和MRF重建全局数据,并引入降维与一致性强制技术,有效提升了合成数据的隐私保护与效用。

摘要:

数据合成是一种有前景的解决方案,可在不暴露原始数据的情况下共享数据以用于各种下游分析任务。然而,如果没有理论上的隐私保证,合成数据集仍会泄露一些敏感信息。因此,差分隐私被广泛采用,通过严格限制发布的信息来保护数据合成。这种技术具有优势,但在纵向联邦设置中提出了重大挑战,因为数据属性分布在不同的数据方之间。主要挑战在于在维护隐私的同时,高效且精确地重建跨方属性之间的相关性。在本文中,我们提出了一种名为VertiMRF的新算法,专门设计用于在纵向设置中生成合成数据,并为数据方共享的所有信息提供差分隐私保护。我们引入了基于Flajolet-Martin sketch(或频率预言机)的技术,用于编码满足差分隐私的本地数据并估计跨方边缘分布。我们为这种多属性数据中的编码提供了理论隐私和效用证明。通过收集本地生成的私有马尔可夫随机场(MRF)和sketch,中央服务器可以重建全局MRF,从而保留最有用的信息。此外,我们引入了两种针对具有大属性域大小的数据集量身定制的技巧,即降维和一致性强制。这两种技巧允许本地私有MRF和数据sketch模块采用灵活且不一致的分箱策略,从而最大程度地保留信息。我们在四个真实世界数据集上进行了广泛实验,以评估VertiMRF的有效性。端到端比较证明了VertiMRF的优越性,消融研究验证了每个组件的有效性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑