arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1301.6447cs.DS
收藏

近似最优私有卷积

Nearly Optimal Private Convolution

Nadia Fawaz, S. Muthukrishnan, Aleksandar Nikolov

摘要:

我们研究计算一个私人输入$x$与一个公共输入$h$的卷积,同时满足$(ε, δ)$ -差分隐私的保证。卷积是一种基本运算,与傅里叶变换密切相关。在我们的设置中,私人输入可以表示敏感事件的时间序列或机密个人信息数据库的直方图。卷积然后捕获重要的原语,包括线性滤波,这是时间序列分析中的一个重要工具,以及对数据投影的聚合查询。我们给出了一个近似最优的卷积计算算法,同时满足$(ε, δ)$ -差分隐私。令人惊讶的是,我们遵循简单的策略,将独立的拉普拉斯噪声添加到每个傅立叶系数中,并使用Dwork,Rothblum和Vadhan的合成定理来限制隐私损失。我们推导出一个封闭的形式表达的最佳噪声添加到每个傅立叶系数使用凸规划对偶。我们的算法是非常有效的-它基本上是没有更多的计算成本比快速傅立叶变换。为了证明近最优性,我们使用最近的差异下界的Muthukrishnan和Nikolov,并推导出一个谱下界使用的特征差异的决定因素。

英文摘要:

We study computing the convolution of a private input $x$ with a public input $h$, while satisfying the guarantees of $(ε, δ)$-differential privacy. Convolution is a fundamental operation, intimately related to Fourier Transforms. In our setting, the private input may represent a time series of sensitive events or a histogram of a database of confidential personal information. Convolution then captures important primitives including linear filtering, which is an essential tool in time series analysis, and aggregation queries on projections of the data. We give a nearly optimal algorithm for computing convolutions while satisfying $(ε, δ)$-differential privacy. Surprisingly, we follow the simple strategy of adding independent Laplacian noise to each Fourier coefficient and bounding the privacy loss using the composition theorem of Dwork, Rothblum, and Vadhan. We derive a closed form expression for the optimal noise to add to each Fourier coefficient using convex programming duality. Our algorithm is very efficient -- it is essentially no more computationally expensive than a Fast Fourier Transform. To prove near optimality, we use the recent discrepancy lowerbounds of Muthukrishnan and Nikolov and derive a spectral lower bound using a characterization of discrepancy in terms of determinants.

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

↑