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

迈向计算与统计差分隐私的分离

Towards Separating Computational and Statistical Differential Privacy

Badih Ghazi, Rahul Ilango, Pritish Kamath, Ravi Kumar, Pasin Manurangsi

AI总结:

本文在特定密码学假设下首次构造了可用计算差分隐私(CDP)实现但不可用统计差分隐私(SDP)实现的任务,并提出一种通过决策树敌手和密码学构造证明CDP的新方法。

摘要:

计算差分隐私(CDP)是标准(统计)差分隐私(SDP)概念的自然放宽,由Beimel、Nissim和Omri(CRYPTO 2008)以及Mironov、Pandey、Reingold和Vadhan(CRYPTO 2009)提出。与SDP不同,CDP仅要求隐私保证抵御计算受限的敌手,而非计算不受限的统计敌手。尽管该问题在多项研究中被明确提出(如Bun、Chen和Vadhan,TCC 2016),但是否存在任何可用CDP而非SDP概念实现的任务,一直悬而未决。甚至不存在此类候选任务,也不清楚真相为何。在本研究中,我们在以下强但合理的密码学假设下,首次构造了一个可用CDP而非SDP概念实现的任务:(1)非交互式见证不可区分证明;(2)简洁抗碰撞无密钥哈希函数;(3)针对公共硬币采样器的差异输入混淆。具体而言,我们构造了一个任务,存在一个ε-CDP机制(ε=O(1))实现1-o(1)的效用,但任何实现常数效用的(ε, δ)-SDP机制(包括计算不受限的机制)必须使用超常数ε或反多项式大小的δ。为证明此点,我们引入了一种新方法来展示机制满足CDP:首先证明机制对某类决策树敌手是“私有的”,然后利用密码学构造将其“提升”为抵御计算受限敌手的隐私。我们相信该方法对设计更多分离CDP与SDP的任务具有参考价值。

英文摘要:

Computational differential privacy (CDP) is a natural relaxation of the standard notion of (statistical) differential privacy (SDP) proposed by Beimel, Nissim, and Omri (CRYPTO 2008) and Mironov, Pandey, Reingold, and Vadhan (CRYPTO 2009). In contrast to SDP, CDP only requires privacy guarantees to hold against computationally-bounded adversaries rather than computationally-unbounded statistical adversaries. Despite the question being raised explicitly in several works (e.g., Bun, Chen, and Vadhan, TCC 2016), it has remained tantalizingly open whether there is any task achievable with the CDP notion but not the SDP notion. Even a candidate such task is unknown. Indeed, it is even unclear what the truth could be! In this work, we give the first construction of a task achievable with the CDP notion but not the SDP notion, under the following strong but plausible cryptographic assumptions: (1) Non-Interactive Witness Indistinguishable Proofs, (2) Laconic Collision-Resistant Keyless Hash Functions, (3) Differing-Inputs Obfuscation for Public-Coin Samplers. In particular, we construct a task for which there exists an $\varepsilon$-CDP mechanism with $\varepsilon = O(1)$ achieving $1-o(1)$ utility, but any $(\varepsilon, δ)$-SDP mechanism, including computationally-unbounded ones, that achieves a constant utility must use either a super-constant $\varepsilon$ or an inverse-polynomially large $δ$. To prove this, we introduce a new approach for showing that a mechanism satisfies CDP: first we show that a mechanism is "private" against a certain class of decision tree adversaries, and then we use cryptographic constructions to "lift" this into privacy against computationally bounded adversaries. We believe this approach could be useful to devise further tasks separating CDP from SDP.

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

↑