arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.03974cs.CRcs.IRcs.ITcs.LGmath.IT
收藏

Rainbow差分隐私

Rainbow Differential Privacy

Technical University of Berlin(柏林工业大学);University of Siegen(锡根大学);Clemson University(克莱姆森大学);Massachusetts Institute of Technology(麻省理工学院);University of New South Wales(新南威尔士大学)

Ziqi Zhou, Onur Günlü, Rafael G. L. D'Oliveira, Muriel Médard, Parastoo Sadeghi, Rafael F. Schaefer

摘要:

我们扩展了以前的框架设计差分私人(DP)机制,通过随机图着色,被限制为二进制函数,对应于图中的着色,多值函数。和前面一样,数据集是图中的节点,任何两个相邻的数据集都由边连接。在我们的设置中,我们假设每个数据集对该机制的可能输出都有一个优先顺序,每个输出都被称为彩虹。不同的彩虹将数据集的图形划分为不同的区域。我们表明,如果DP机制是预先指定在这些区域的边界和行为相同的所有相同的彩虹边界数据集,最多一个最佳的这种机制可以存在和问题可以通过一个态射的线图来解决。然后,我们展示了封闭形式的表达的线图的情况下,三元函数。本文对三元查询的处理显示了足够的丰富性,可以扩展到具有优先查询排序的高维查询空间,但最优性证明似乎并不直接来自三元证明。

英文摘要:

We extend a previous framework for designing differentially private (DP) mechanisms via randomized graph colorings that was restricted to binary functions, corresponding to colorings in a graph, to multi-valued functions. As before, datasets are nodes in the graph and any two neighboring datasets are connected by an edge. In our setting, we assume that each dataset has a preferential ordering for the possible outputs of the mechanism, each of which we refer to as a rainbow. Different rainbows partition the graph of datasets into different regions. We show that if the DP mechanism is pre-specified at the boundary of such regions and behaves identically for all same-rainbow boundary datasets, at most one optimal such mechanism can exist and the problem can be solved by means of a morphism to a line graph. We then show closed form expressions for the line graph in the case of ternary functions. Treatment of ternary queries in this paper displays enough richness to be extended to higher-dimensional query spaces with preferential query ordering, but the optimality proof does not seem to follow directly from the ternary proof.

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

↑