论文标题
关于树木上的私密计算
On Differentially Private Counting on Trees
论文作者
论文摘要
我们研究了在层次结构中执行不同级别的计数查询的问题，同时保留个人的隐私。通过应用程序的促进，我们通过考虑将乘法和添加剂近似与查询结果相结合，为此问题提出了一种新的错误度量。我们检查了差异隐私（DP）中的已知机制，并在纯dp设置下证明了它们的最佳性。在大约DP设置中，我们设计了与已知算法有关的新算法。
We study the problem of performing counting queries at different levels in hierarchical structures while preserving individuals' privacy. Motivated by applications, we propose a new error measure for this problem by considering a combination of multiplicative and additive approximation to the query results. We examine known mechanisms in differential privacy (DP) and prove their optimality, under this measure, in the pure-DP setting. In the approximate-DP setting, we design new algorithms achieving significant improvements over known ones.
