论文标题

基于精确的攻击和间隔完善:如何打破,然后修复有限计算机上的差异隐私

Precision-based attacks and interval refining: how to break, then fix, differential privacy on finite computers

论文作者

Haney, Samuel, Desfontaines, Damien, Hartman, Luke, Shrestha, Ruchit, Hay, Michael

论文摘要

尽管在十年前被提出是一个问题,但浮点算术的不精确仍会在实施差异私人噪声机制的实施中导致隐私失败。在本文中,我们重点介绍了一个新的漏洞类,我们称之为\ emph {基于Precision的攻击},并影响了几个开源库。为了解决此漏洞并以安全的方式实施浮动点空间上的私有机制,我们提出了一种新型技术,称为\ emph {Interval Reftining}。该技术具有最小的错误,可证明的隐私和广泛的适用性。我们使用间隔精炼来设计和实现拉普拉斯机制的变体,该变体等同于从拉普拉斯分布和舍入到浮子的样品。我们报告了这种方法的性能,并讨论如何使用间隔精炼来安全地实施其他机制,包括高斯机制和指数机制。

Despite being raised as a problem over ten years ago, the imprecision of floating point arithmetic continues to cause privacy failures in the implementations of differentially private noise mechanisms. In this paper, we highlight a new class of vulnerabilities, which we call \emph{precision-based attacks}, and which affect several open source libraries. To address this vulnerability and implement differentially private mechanisms on floating-point space in a safe way, we propose a novel technique, called \emph{interval refining}. This technique has minimal error, provable privacy, and broad applicability. We use interval refining to design and implement a variant of the Laplace mechanism that is equivalent to sampling from the Laplace distribution and rounding to a float. We report on the performance of this approach, and discuss how interval refining can be used to implement other mechanisms safely, including the Gaussian mechanism and the exponential mechanism.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源