Concurrent composition for differentially private continual mechanisms Henzinger, Monika H ; https://orcid.org/0000-0002-5008-6530 Safavi Hemami, Roodabeh Vadhan, Salil differential privacy concurrent composition continual release continual observation data streaming continual mechanisms concurrent parallel composition concurrent filter composition ddc:000 Many intended uses of differential privacy involve a continual mechanism that is set up to run continuously over a long period of time, making more statistical releases as either queries come in or the dataset is updated. In this paper, we give the first general treatment of privacy against adaptive adversaries for mechanisms that support dataset updates and a variety of queries, all arbitrarily interleaved. It also models a very general notion of neighboring, that includes both event-level and user-level privacy. We prove several concurrent composition theorems for continual mechanisms, which ensure privacy even when an adversary can interleave its queries and dataset updates to the different composed mechanisms. Previous concurrent composition theorems for differential privacy were only for the case when the dataset is static, with no adaptive updates. We also give the first interactive and continual generalizations of the “parallel composition theorem” for noninteractive differential privacy. Specifically, we show that the analogue of the noninteractive parallel composition theorem holds if either there are no adaptive dataset updates or each of the composed mechanisms satisfies pure differential privacy, but it fails to hold for composing approximately differentially private mechanisms with dataset updates. Thus, we prove a tight new composition theorem for this case. In addition, we prove concurrent filter compositions theorems for the scenarios in which the privacy parameters are adaptively chosen. We extend these results to other measures of differential privacy, including Rényi DP and 𝑓 -DP. We then formalize a set of general conditions on a continual mechanism M that runs multiple continual submechanisms such that the privacy guarantees of M follow directly using the above concurrent composition theorems on the sub-mechanisms, without further privacy loss. This enables us to give a simpler and modular privacy analysis of a recent continual histogram mechanism of Henzinger, Sricharan, and Steiner. In the case of approximate DP, ours is the first proof that shows that its privacy holds against adaptive adversaries. We also provide a framework that simplifies the analysis of local differential privacy when the protocol includes multi-round server-user interactions. Using this result, we simplify the privacy analysis of the core decomposition protocol of Dhulipala, Henzinger, Li, Liu, Sricharan, and Zhu [5]. Association for Computing Machinery 2026 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_2df8fbb1 https://research-explorer.ista.ac.at/record/22318 https://research-explorer.ista.ac.at/download/22318/22345 Henzinger M, Safavi Hemami R, Vadhan S. Concurrent composition for differentially private continual mechanisms. <i>Proceedings of the ACM on Management of Data</i>. 2026;4(2):1-26. doi:<a href="https://doi.org/10.1145/3801895">10.1145/3801895</a> eng info:eu-repo/semantics/altIdentifier/doi/10.1145/3801895 info:eu-repo/semantics/altIdentifier/issn/2836-6573 info:eu-repo/semantics/altIdentifier/arxiv/2411.03299 info:eu-repo/semantics/openAccess