{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T01:17:44Z","timestamp":1778807864958,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Simons Investigator Award","award":[""],"award-info":[{"award-number":[""]}]},{"name":"Computing Research Association (CRA) and the Computing Community Consortium (CCC)","award":["Computing Innovation Fellowship"],"award-info":[{"award-number":["Computing Innovation Fellowship"]}]},{"name":"Sloan Foundation","award":[""],"award-info":[{"award-number":[""]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585241","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"507-519","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Concurrent Composition Theorems for Differential Privacy"],"prefix":"10.1145","author":[{"given":"Salil","family":"Vadhan","sequence":"first","affiliation":[{"name":"Harvard University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wanrong","family":"Zhang","sequence":"additional","affiliation":[{"name":"Harvard University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"David Blackwell. 1953. Equivalent comparisons of experiments. The annals of mathematical statistics 265\u2013272. \t\t\t\t  David Blackwell. 1953. Equivalent comparisons of experiments. The annals of mathematical statistics 265\u2013272.","DOI":"10.1214\/aoms\/1177729032"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_24"},{"key":"e_1_3_2_1_3_1","unstructured":"Jinshuo Dong Aaron Roth and Weijie J Su. 2019. Gaussian differential privacy. arXiv preprint arXiv:1905.02383. \t\t\t\t  Jinshuo Dong Aaron Roth and Weijie J Su. 2019. Gaussian differential privacy. arXiv preprint arXiv:1905.02383."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_29"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC \u201910)","author":"Dwork Cynthia","unstructured":"Cynthia Dwork , Moni Naor , Toniann Pitassi , and Guy N. Rothblum . 2010. Differential privacy under continual observation . In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC \u201910) . 715\u2013724. Cynthia Dwork, Moni Naor, Toniann Pitassi, and Guy N. Rothblum. 2010. Differential privacy under continual observation. In Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC \u201910). 715\u2013724."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of the 41st ACM Symposium on Theory of Computing (STOC \u201909)","author":"Dwork Cynthia","unstructured":"Cynthia Dwork , Moni Naor , Omer Reingold , Guy N. Rothblum , and Salil P. Vadhan . 2009. On the complexity of differentially private data release: efficient algorithms and hardness results . In Proceedings of the 41st ACM Symposium on Theory of Computing (STOC \u201909) . 381\u2013390. Cynthia Dwork, Moni Naor, Omer Reingold, Guy N. Rothblum, and Salil P. Vadhan. 2009. On the complexity of differentially private data release: efficient algorithms and hardness results. In Proceedings of the 41st ACM Symposium on Theory of Computing (STOC \u201909). 381\u2013390."},{"key":"e_1_3_2_1_8_1","first-page":"3","article-title":"The algorithmic foundations of differential privacy","volume":"9","author":"Dwork Cynthia","year":"2014","unstructured":"Cynthia Dwork and Aaron Roth . 2014 . The algorithmic foundations of differential privacy . Foundations and Trends in Theoretical Computer Science , 9 , 3 \u2013 4 (2014), 211\u2013407. Cynthia Dwork and Aaron Roth. 2014. The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science, 9, 3\u20134 (2014), 211\u2013407.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"key":"e_1_3_2_1_9_1","unstructured":"Cynthia Dwork and Guy N Rothblum. 2016. Concentrated differential privacy. arXiv preprint arXiv:1603.01887. \t\t\t\t  Cynthia Dwork and Guy N Rothblum. 2016. Concentrated differential privacy. arXiv preprint arXiv:1603.01887."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.12"},{"key":"e_1_3_2_1_11_1","volume-title":"A multiplicative weights mechanism for privacy-preserving data analysis. In 2010 IEEE 51st annual symposium on foundations of computer science. 61\u201370","author":"Hardt Moritz","unstructured":"Moritz Hardt and Guy N Rothblum . 2010. A multiplicative weights mechanism for privacy-preserving data analysis. In 2010 IEEE 51st annual symposium on foundations of computer science. 61\u201370 . Moritz Hardt and Guy N Rothblum. 2010. A multiplicative weights mechanism for privacy-preserving data analysis. In 2010 IEEE 51st annual symposium on foundations of computer science. 61\u201370."},{"key":"e_1_3_2_1_12_1","volume-title":"International conference on machine learning. 1376\u20131385","author":"Kairouz Peter","year":"2015","unstructured":"Peter Kairouz , Sewoong Oh , and Pramod Viswanath . 2015 . The composition theorem for differential privacy . In International conference on machine learning. 1376\u20131385 . Peter Kairouz, Sewoong Oh, and Pramod Viswanath. 2015. The composition theorem for differential privacy. In International conference on machine learning. 1376\u20131385."},{"key":"e_1_3_2_1_13_1","volume-title":"Composition Theorems for Interactive Differential Privacy. In Thirty-sixth Conference on Neural Information Processing Systems.","author":"Lyu Xin","year":"2022","unstructured":"Xin Lyu . 2022 . Composition Theorems for Interactive Differential Privacy. In Thirty-sixth Conference on Neural Information Processing Systems. Xin Lyu. 2022. Composition Theorems for Interactive Differential Privacy. In Thirty-sixth Conference on Neural Information Processing Systems."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2017.11"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49096-9_7"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the fourth Berkeley symposium on mathematical statistics and probability. 1.","author":"R\u00e9nyi Alfr\u00e9d","year":"1961","unstructured":"Alfr\u00e9d R\u00e9nyi . 1961 . On measures of entropy and information . In Proceedings of the fourth Berkeley symposium on mathematical statistics and probability. 1. Alfr\u00e9d R\u00e9nyi. 1961. On measures of entropy and information. In Proceedings of the fourth Berkeley symposium on mathematical statistics and probability. 1."},{"key":"e_1_3_2_1_17_1","volume-title":"Concurrent Composition of Differential Privacy. In Theory of Cryptography Conference. 582\u2013604","author":"Vadhan Salil","year":"2021","unstructured":"Salil Vadhan and Tianhao Wang . 2021 . Concurrent Composition of Differential Privacy. In Theory of Cryptography Conference. 582\u2013604 . Salil Vadhan and Tianhao Wang. 2021. Concurrent Composition of Differential Privacy. In Theory of Cryptography Conference. 582\u2013604."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Salil Vadhan and Wanrong Zhang. 2022. Concurrent Composition Theorems for all Standard Variants of Differential Privacy. arXiv preprint arXiv:2207.08335. \t\t\t\t  Salil Vadhan and Wanrong Zhang. 2022. Concurrent Composition Theorems for all Standard Variants of Differential Privacy. arXiv preprint arXiv:2207.08335.","DOI":"10.1145\/3564246.3585241"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2320500"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1965.10480775"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.tm08651"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","location":"Orlando FL USA","acronym":"STOC '23","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585241","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585241","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:02Z","timestamp":1750178822000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585241"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":21,"alternative-id":["10.1145\/3564246.3585241","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585241","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}