{"external_id":{"arxiv":["2106.14756"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","alternative_title":["LIPIcs"],"publication_status":"published","date_created":"2022-08-12T07:04:44Z","month":"08","publication":"29th Annual European Symposium on Algorithms","type":"conference","date_updated":"2023-02-14T08:28:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","doi":"10.4230/LIPIcs.ESA.2021.42","extern":"1","_id":"11814","status":"public","conference":{"end_date":"2021-09-08","location":"Lisbon, Portual","start_date":"2021-09-06","name":"ESA: Annual European Symposium on Algorithms"},"year":"2021","abstract":[{"lang":"eng","text":"Differentially private algorithms protect individuals in data analysis scenarios by ensuring that there is only a weak correlation between the existence of the user in the data and the result of the analysis. Dynamic graph algorithms maintain the solution to a problem (e.g., a matching) on an evolving input, i.e., a graph where nodes or edges are inserted or deleted over time. They output the value of the solution after each update operation, i.e., continuously. We study (event-level and user-level) differentially private algorithms for graph problems under continual observation, i.e., differentially private dynamic graph algorithms. We present event-level private algorithms for partially dynamic counting-based problems such as triangle count that improve the additive error by a polynomial factor (in the length T of the update sequence) on the state of the art, resulting in the first algorithms with additive error polylogarithmic in T.\r\nWe also give ε-differentially private and partially dynamic algorithms for minimum spanning tree, minimum cut, densest subgraph, and maximum matching. The additive error of our improved MST algorithm is O(W log^{3/2}T / ε), where W is the maximum weight of any edge, which, as we show, is tight up to a (√{log T} / ε)-factor. For the other problems, we present a partially-dynamic algorithm with multiplicative error (1+β) for any constant β > 0 and additive error O(W log(nW) log(T) / (ε β)). Finally, we show that the additive error for a broad class of dynamic graph algorithms with user-level privacy must be linear in the value of the output solution’s range."}],"oa":1,"main_file_link":[{"url":"https://doi.org/10.4230/LIPIcs.ESA.2021.42","open_access":"1"}],"author":[{"full_name":"Fichtenberger, Hendrik","first_name":"Hendrik","last_name":"Fichtenberger"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H"},{"full_name":"Ost, Wolfgang","first_name":"Wolfgang","last_name":"Ost"}],"day":"31","language":[{"iso":"eng"}],"article_number":"42","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772044"]},"title":"Differentially private algorithms for graphs under continual observation","intvolume":"       204","citation":{"apa":"Fichtenberger, H., Henzinger, M. H., &#38; Ost, W. (2021). Differentially private algorithms for graphs under continual observation. In <i>29th Annual European Symposium on Algorithms</i> (Vol. 204). Lisbon, Portual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2021.42\">https://doi.org/10.4230/LIPIcs.ESA.2021.42</a>","chicago":"Fichtenberger, Hendrik, Monika H Henzinger, and Wolfgang Ost. “Differentially Private Algorithms for Graphs under Continual Observation.” In <i>29th Annual European Symposium on Algorithms</i>, Vol. 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. <a href=\"https://doi.org/10.4230/LIPIcs.ESA.2021.42\">https://doi.org/10.4230/LIPIcs.ESA.2021.42</a>.","ama":"Fichtenberger H, Henzinger MH, Ost W. Differentially private algorithms for graphs under continual observation. In: <i>29th Annual European Symposium on Algorithms</i>. Vol 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2021.42\">10.4230/LIPIcs.ESA.2021.42</a>","short":"H. Fichtenberger, M.H. Henzinger, W. Ost, in:, 29th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ieee":"H. Fichtenberger, M. H. Henzinger, and W. Ost, “Differentially private algorithms for graphs under continual observation,” in <i>29th Annual European Symposium on Algorithms</i>, Lisbon, Portual, 2021, vol. 204.","ista":"Fichtenberger H, Henzinger MH, Ost W. 2021. Differentially private algorithms for graphs under continual observation. 29th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 204, 42.","mla":"Fichtenberger, Hendrik, et al. “Differentially Private Algorithms for Graphs under Continual Observation.” <i>29th Annual European Symposium on Algorithms</i>, vol. 204, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ESA.2021.42\">10.4230/LIPIcs.ESA.2021.42</a>."},"article_processing_charge":"No","scopus_import":"1","volume":204,"date_published":"2021-08-31T00:00:00Z","quality_controlled":"1"}