@article {1595532,
	title = {Concurrent Composition of Differential Privacy},
	journal = {Proceedings of the 19th Theory of Cryptography Conference (TCC {\textquoteright}21)},
	volume = {13043},
	year = {2021},
	abstract = {
	We initiate a study of the composition properties of interactive dierentially private mechanisms. An interactive dierentially private mechanism is an algorithm that allows an analyst to adaptively ask\&nbsp;queries about a sensitive dataset, with the property that an adversarial



	analyst{\textquoteright}s view of the interaction is approximately the same regardless of\&nbsp;whether or not any individual{\textquoteright}s data is in the dataset. Previous studies of composition of dierential privacy have focused on non-interactive\&nbsp;algorithms, but interactive mechanisms are needed to capture many of\&nbsp;the intended applications of dierential privacy and a number of the\&nbsp;important dierentially private primitives.



	\&nbsp;



	We focus on concurrent composition, where an adversary can arbitrarily interleave its queries to several dierentially private mechanisms,\&nbsp;which may be feasible when dierentially private query systems are deployed in practice. We prove that when the interactive mechanisms being composed are pure dierentially private, their concurrent composition achieves privacy parameters (with respect to pure or approximate\&nbsp;dierential privacy) that match the (optimal) composition theorem for\&nbsp;noninteractive dierential privacy. We also prove a composition theorem\&nbsp;for interactive mechanisms that satisfy approximate dierential privacy.\&nbsp;That bound is weaker than even the basic (suboptimal) composition theorem for noninteractive dierential privacy, and we leave closing the gap\&nbsp;as a direction for future research, along with understanding concurrent\&nbsp;composition for other variants of dierential privacy.

},
	url = {https://arxiv.org/abs/2105.14427},
	author = {Salil Vadhan and Tianhao Wang}
}
