arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.11341cs.DScs.CR
收藏

直方图及相关查询的差分隐私持续发布

Differentially Private Continual Release of Histograms and Related Queries

Monika Henzinger, A. R. Sricharan, Teresa Anna Steiner

AI总结:

本文研究差分隐私下直方图及相关查询的持续发布,提出仅插入模型和十字转门模型中输出敏感机制,分别以 O(d log²(dq*)+log T) 和 O(d log²(dK)+log T) 的加性误差改进现有下界。

摘要:

我们研究在持续发布模型下,对一个包含来自全域 χ 的条目、经历 T 次行更新的 d 维表进行列和(称为直方图)的隐私发布。对于一大类查询和输入流,我们的机制提供了比现有机制更好的加性 ℓ∞ 误差。我们的第一个贡献是在仅插入模型(χ = {0,1})中提出一种输出敏感的机制,用于维护(i)直方图或(ii)不需要维护整个直方图的查询,例如最大或最小列和、中位数或任意分位数。该机制的加性误差以高概率为 O(d log²(dq*) + log T),其中 q* 是该数据集在所有时间步上的最大输出值。该机制不需要 q* 作为输入。当 q* ≪ T 时,这打破了先前工作的 Ω(d log T) 下界。我们的第二个贡献是针对十字转门模型的机制,该模型允许负条目更新(χ = {-1, 0, 1})。该机制的加性误差以高概率为 O(d log²(dK) + log T),其中 K 是连续两行数据不同的次数,并且该机制不需要 K 作为输入。这在监测仅在异常情况下才发生变化的输入时非常有用。对于 d = 1 的情况,这给出了十字转门模型中持续计数问题的第一个误差为 O(log² K + log T) 的隐私机制,改进了 Dwork 等人 [ASIACRYPT 2015] 的 O(log² n + log T) 误差界,其中 n 是流中 1 的个数,同时允许负条目,而 Dwork 等人 [ASIACRYPT 2015] 只能处理非负条目(χ = {0,1})。

英文摘要:

We study privately releasing column sums of a $d$-dimensional table with entries from a universe $χ$ undergoing $T$ row updates, called histogram under continual release. Our mechanisms give better additive $\ell_\infty$-error than existing mechanisms for a large class of queries and input streams. Our first contribution is an output-sensitive mechanism in the insertions-only model ($χ= \{0,1\}$) for maintaining (i) the histogram or (ii) queries that do not require maintaining the entire histogram, such as the maximum or minimum column sum, the median, or any quantiles. The mechanism has an additive error of $O(d\log^2 (dq^*)+\log T)$ whp, where $q^*$ is the maximum output value over all time steps on this dataset. The mechanism does not require $q^*$ as input. This breaks the $Ω(d \log T)$ bound of prior work when $q^* \ll T$. Our second contribution is a mechanism for the turnstile model that admits negative entry updates ($χ= \{-1, 0,1\}$). This mechanism has an additive error of $O(d \log^2 (dK) + \log T)$ whp, where $K$ is the number of times two consecutive data rows differ, and the mechanism does not require $K$ as input. This is useful when monitoring inputs that only vary under unusual circumstances. For $d=1$ this gives the first private mechanism with error $O(\log^2 K + \log T)$ for continual counting in the turnstile model, improving on the $O(\log^2 n + \log T)$ error bound by Dwork et al. [ASIACRYPT 2015], where $n$ is the number of ones in the stream, as well as allowing negative entries, while Dwork et al. [ASIACRYPT 2015] can only handle nonnegative entries ($χ=\{0,1\}$).

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

↑