arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2201.07388cs.CRstat.AP
收藏

河豚隐私的Kantorovich机制

Kantorovich Mechanism for Pufferfish Privacy

Ni Ding

摘要:

河豚隐私在所公开的数据中的一组秘密对上实现了$ε$ -不可验证性。研究了如何利用指数机制实现$ε$ -pufferfish的隐私保护。指数机制是一种推广了Laplace噪声的加性噪声方案。它示出,所公开的数据是$ε$ -河豚私人的,如果噪声被校准到Kantorovich最优运输计划的灵敏度。这样的计划可以直接从以秘密为条件的数据统计中获得,系统的先验知识。充分条件进一步放宽,以降低噪声功率。证明了基于Kantorovich方法的高斯机制达到了$ε$ -河豚隐私的$δ$ -近似.

英文摘要:

Pufferfish privacy achieves $ε$-indistinguishability over a set of secret pairs in the disclosed data. This paper studies how to attain $ε$-pufferfish privacy by exponential mechanism, an additive noise scheme that generalizes the Laplace noise. It is shown that the disclosed data is $ε$-pufferfish private if the noise is calibrated to the sensitivity of the Kantorovich optimal transport plan. Such a plan can be obtained directly from the data statistics conditioned on the secret, the prior knowledge of the system. The sufficient condition is further relaxed to reduce the noise power. It is also proved that the Gaussian mechanism based on the Kantorovich approach attains the $δ$-approximation of $ε$-pufferfish privacy.

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

↑