Concurrent Composition Theorems for Differential Privacy

PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023(2023)

引用 5|浏览46
暂无评分
摘要
We study the concurrent composition properties of interactive differentially private mechanisms, whereby an adversary can arbitrarily interleave its queries to the different mechanisms. We prove that all composition theorems for non-interactive differentially private mechanisms extend to the concurrent composition of interactive differentially private mechanisms, whenever differential privacy is measured using the hypothesis testing framework of f-DP, which captures standard (epsilon, delta)-DP as a special case. We prove the concurrent composition theorem by showing that every interactive f-DP mechanism can be simulated by interactive post-processing of a non-interactive f-DP mechanism. In concurrent and independent work, Lyu (NeurIPS '22) proves a similar result to ours for (epsilon,delta)-DP, as well as a concurrent composition theorem for Renyi DP. We also provide a simple proof of Lyu's concurrent composition theorem for Renyi DP. Lyu leaves the general case of f-DP as an open problem, which we solve in this paper.
更多
查看译文
关键词
Differential Privacy,Interactive Mechanisms,Concurrent Composition
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要