arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.10068cs.CRcs.DS
收藏

具有低误差、最优空间和快速访问的差分私有稀疏向量

Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access

Martin Aumüller, Christian Janos Lebeda, Rasmus Pagh

摘要:

表示稀疏直方图或更一般地表示稀疏向量是差分隐私中的基本任务。理想的解决方案将使用接近信息理论下限的空间,具有最佳地取决于所需隐私级别的错误分布,并允许快速随机访问向量中的条目。然而,现有的方法只实现了这三个目标中的两个。在本文中,我们介绍了近似拉普拉斯投影(ALP)机制近似k-稀疏向量。这种机制同时具有信息理论上的最优空间(常数因子),快速访问矢量条目,和错误的拉普拉斯机制适用于密集的矢量相同的幅度。一个关键的新技术是小整数的一元表示,我们证明了它对“随机响应”噪声的鲁棒性。这种表示与散列相结合,在布隆过滤器的精神,以获得空间效率,差异私人表示。我们的理论性能界限的补充模拟表明,主要性能参数的常数因子是相当小的,这表明该技术的实用性。

英文摘要:

Representing a sparse histogram, or more generally a sparse vector, is a fundamental task in differential privacy. An ideal solution would use space close to information-theoretical lower bounds, have an error distribution that depends optimally on the desired privacy level, and allow fast random access to entries in the vector. However, existing approaches have only achieved two of these three goals. In this paper we introduce the Approximate Laplace Projection (ALP) mechanism for approximating k-sparse vectors. This mechanism is shown to simultaneously have information-theoretically optimal space (up to constant factors), fast access to vector entries, and error of the same magnitude as the Laplace-mechanism applied to dense vectors. A key new technique is a unary representation of small integers, which we show to be robust against ``randomized response'' noise. This representation is combined with hashing, in the spirit of Bloom filters, to obtain a space-efficient, differentially private representation. Our theoretical performance bounds are complemented by simulations which show that the constant factors on the main performance parameters are quite small, suggesting practicality of the technique.

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

↑