{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T09:55:07Z","timestamp":1765619707822,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,12,2]],"date-time":"2024-12-02T00:00:00Z","timestamp":1733097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,12,2]]},"DOI":"10.1145\/3658644.3690271","type":"proceedings-article","created":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T12:19:20Z","timestamp":1733746760000},"page":"273-287","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["<i>DPM:<\/i>\n            Clustering Sensitive Data through Separation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-0911-2582","authenticated-orcid":false,"given":"Johannes","family":"Liebenow","sequence":"first","affiliation":[{"name":"Universit\u00e4t zu L\u00fcbeck, L\u00fcbeck, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-6717-7056","authenticated-orcid":false,"given":"Yara","family":"Sch\u00fctt","sequence":"additional","affiliation":[{"name":"Universit\u00e4t zu L\u00fcbeck, L\u00fcbeck, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0282-4284","authenticated-orcid":false,"given":"Tanya","family":"Braun","sequence":"additional","affiliation":[{"name":"University of M\u00fcnster, M\u00fcnster, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9056-7673","authenticated-orcid":false,"given":"Marcel","family":"Gehrke","sequence":"additional","affiliation":[{"name":"University of Hamburg, Hamburg, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6870-5643","authenticated-orcid":false,"given":"Florian","family":"Thaeter","sequence":"additional","affiliation":[{"name":"Independent, Vancover, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2799-8128","authenticated-orcid":false,"given":"Esfandiar","family":"Mohammadi","sequence":"additional","affiliation":[{"name":"Universit\u00e4t zu L\u00fcbeck, L\u00fcbeck, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"International Conference on Machine Learning. PMLR, 322--331","author":"Balcan Maria-Florina","year":"2017","unstructured":"Maria-Florina Balcan, Travis Dick, Yingyu Liang, Wenlong Mou, and Hongyang Zhang. 2017. Differentially private clustering in high-dimensional euclidean spaces. In International Conference on Machine Learning. PMLR, 322--331."},{"key":"e_1_3_2_1_2_1","unstructured":"Alisa Chang Badih Ghazi Ravi Kumar and Pasin Manurangsi. 2021. Locally private k-means in one round. In ICML. PMLR 1441--1451."},{"key":"e_1_3_2_1_3_1","volume-title":"Differentially private empirical risk minimization. JMLR 12, 3","author":"Chaudhuri Kamalika","year":"2011","unstructured":"Kamalika Chaudhuri, Claire Monteleoni, and Anand D Sarwate. 2011. Differentially private empirical risk minimization. JMLR 12, 3 (2011)."},{"key":"e_1_3_2_1_4_1","unstructured":"E. Cohen H. Kaplan Y. Mansour U. Stemmer and E. Tsfadia. 2021. Differentiallyprivate clustering of easy instances. In ICML. PMLR 2049--2059."},{"key":"e_1_3_2_1_5_1","volume-title":"Differentially private confidence intervals. arXiv preprint arXiv:2001.02285","author":"Du Wenxin","year":"2020","unstructured":"Wenxin Du, Canyon Foot, Monica Moniot, Andrew Bray, and Adam Groce. 2020. Differentially private confidence intervals. arXiv preprint arXiv:2001.02285 (2020)."},{"volume-title":"Theory of Cryptography","author":"Dwork Cynthia","key":"e_1_3_2_1_6_1","unstructured":"Cynthia Dwork, Frank McSherry, Kobbi Nissim, and Adam Smith. 2006. Calibrating Noise to Sensitivity in Private Data Analysis. In Theory of Cryptography, Shai Halevi and Tal Rabin (Eds.). Springer, 265--284."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Cynthia Dwork Aaron Roth et al. 2014. The algorithmic foundations of differential privacy. Foundations and Trends in Theoretical Computer Science 9 (2014).","DOI":"10.1561\/9781601988195"},{"volume-title":"Proceedings of the 16th ACM\/IEEE IPSN.","author":"Feldman D.","key":"e_1_3_2_1_8_1","unstructured":"D. Feldman, C. Xiang, R. Zhu, and D. Rus. 2017. Coresets for differentially private k-means clustering and applications to privacy in mobile sensor networks. In Proceedings of the 16th ACM\/IEEE IPSN."},{"key":"e_1_3_2_1_9_1","unstructured":"B. Ghazi R. Kumar and P. Manurangsi. 2020. Differentially private clustering: Tight approximation ratios. Neurips (2020)."},{"key":"e_1_3_2_1_10_1","unstructured":"Google. 2021. Google's differential privacy libraries. https:\/\/github.com\/google\/ differential-privacy\/"},{"key":"e_1_3_2_1_11_1","unstructured":"Alexander Hinneburg and Daniel A Keim. 1999. Optimal grid-clustering: Towards breaking the curse of dimensionality in high-dimensional clustering. (1999)."},{"key":"e_1_3_2_1_12_1","unstructured":"N. Holohan S. Braghin P\u00f3l M. Aonghusa and K. Levacher. 2019. Diffprivlib: the IBM differential privacy library. ArXiv e-prints 1907.02444 [cs.CR] (July 2019)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196977"},{"volume-title":"Towards practical differentially private convex optimization","author":"Iyengar Roger","key":"e_1_3_2_1_14_1","unstructured":"Roger Iyengar, Joseph P Near, Dawn Song, Om Thakkar, Abhradeep Thakurta, and LunWang. 2019. Towards practical differentially private convex optimization. In IEEE S&P. IEEE, 299--316."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17375"},{"volume-title":"22nd ICDE'06","author":"LeFevre K.","key":"e_1_3_2_1_16_1","unstructured":"K. LeFevre, D. DeWitt, and R. Ramakrishnan. 2006. Mondrian multidimensional k-anonymity. In 22nd ICDE'06. IEEE, 25--25."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560687"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17099"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.10.051"},{"key":"e_1_3_2_1_20_1","unstructured":"Kobbi Nissim and Uri Stemmer. 2018. Clustering algorithms for the centralized and local models. In Algorithmic Learning Theory. PMLR 619--653."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902296"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_1_23_1","unstructured":"M. Shechner O. Sheffet and U. Stemmer. 2020. Private k-means clustering with stability assumptions. In AISTATS. PMLR 2518--2528."},{"key":"e_1_3_2_1_24_1","first-page":"1","article-title":"Locally private k-means clustering","volume":"22","author":"Stemmer Uri","year":"2021","unstructured":"Uri Stemmer. 2021. Locally private k-means clustering. Journal of Machine Learning Research 22, 176 (2021), 1--30.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_1_25_1","volume-title":"Differentially private k-means with constant multiplicative error. Advances in Neural Information Processing Systems 31","author":"Stemmer Uri","year":"2018","unstructured":"Uri Stemmer and Haim Kaplan. 2018. Differentially private k-means with constant multiplicative error. Advances in Neural Information Processing Systems 31 (2018)."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2857705.2857708"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882928"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0206832"}],"event":{"name":"CCS '24: ACM SIGSAC Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Salt Lake City UT USA","acronym":"CCS '24"},"container-title":["Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690271","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3658644.3690271","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T06:19:42Z","timestamp":1755843582000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3658644.3690271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,2]]},"references-count":28,"alternative-id":["10.1145\/3658644.3690271","10.1145\/3658644"],"URL":"https:\/\/doi.org\/10.1145\/3658644.3690271","relation":{},"subject":[],"published":{"date-parts":[[2024,12,2]]},"assertion":[{"value":"2024-12-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}