Concurrent composition theorems for differential privacy

Citation:

Vadhan, Salil, and Wanrong Zhang. “Concurrent composition theorems for differential privacy.” STOC 2023: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC, 2023.
ArXiv 2022.pdf588 KB
STOC 2023.pdf730 KB

Abstract:

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 (,δ)-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 (,δ)-DP, as well as a concurrent composition theorem for Rényi DP. We also provide a simple proof of Lyu’s concurrent composition theorem for Rényi DP. Lyu leaves the general case of f-DP as an open problem, which we solve in this paper.

Version History: Preliminary versions published as: https://arxiv.org/abs/2207.08335 and presented as a poster at TPDP '22.

Publisher's Version

Last updated on 02/26/2024