论文标题
关于估计各种差异隐私概念的(IM)的可能性
On the (Im)Possibility of Estimating Various Notions of Differential Privacy
论文作者
论文摘要
我们分析最终用户可以在多大程度上推断出有关数据混淆机制的先验性(所谓的“ Black-Box”场景)的先验信息,以推断有关其数据保护级别的信息。特别是,我们深入研究了两个当地差异隐私(LDP)的概念,即ε-LDP和RényiLDP。一方面,我们证明,在没有对基础分布的任何假设的情况下,不可能具有能够以可证明的保证来推断数据保护级别的算法;该结果也适用于考虑到DP的两个概念的中心版本。另一方面,我们证明,在合理的假设(即,封闭间隔中所涉及的密度的Lipschitzness)下,存在这种保证,可以通过简单的基于直方图的估计器来实现。我们通过实验验证了结果,并注意到,在表现特别良好的分布(即拉普拉斯噪声)上,我们的方法给出了比预期的更好的结果,因为在实践中,实现所需的置信度所需的样本数量小于理论上的结合,并且ε的估计比预测的更为精确。
We analyze to what extent final users can infer information about the level of protection of their data when the data obfuscation mechanism is a priori unknown to them (the so-called ''black-box'' scenario). In particular, we delve into the investigation of two notions of local differential privacy (LDP), namely ε-LDP and Rényi LDP. On one hand, we prove that, without any assumption on the underlying distributions, it is not possible to have an algorithm able to infer the level of data protection with provable guarantees; this result also holds for the central versions of the two notions of DP considered. On the other hand, we demonstrate that, under reasonable assumptions (namely, Lipschitzness of the involved densities on a closed interval), such guarantees exist and can be achieved by a simple histogram-based estimator. We validate our results experimentally and we note that, on a particularly well-behaved distribution (namely, the Laplace noise), our method gives even better results than expected, in the sense that in practice the number of samples needed to achieve the desired confidence is smaller than the theoretical bound, and the estimation of ε is more precise than predicted.