{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T17:35:20Z","timestamp":1783791320060,"version":"3.55.0"},"reference-count":79,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2023,2]]},"abstract":"<jats:p>\n            In many applications, multiple parties have private data regarding the same set of users but on disjoint sets of attributes, and a server wants to leverage the data to train a model. To enable model learning while protecting the privacy of the data subjects, we need vertical federated learning (VFL) techniques, where the data parties share only information for training the model, instead of the private data. However, it is challenging to ensure that the shared information maintains privacy while learning accurate models. To the best of our knowledge, the algorithm proposed in this paper is the first practical solution for differentially private vertical federated\n            <jats:italic>k<\/jats:italic>\n            -means clustering, where the server can obtain a set of global centers with a provable differential privacy guarantee. Our algorithm assumes an untrusted central server that aggregates differentially private local centers and membership encodings from local data parties. It builds a weighted grid as the synopsis of the global dataset based on the received information. Final centers are generated by running any\n            <jats:italic>k<\/jats:italic>\n            -means algorithm on the weighted grid. Our approach for grid weight estimation uses a novel, light-weight, and differentially private set intersection cardinality estimation algorithm based on the Flajolet-Martin sketch. To improve the estimation accuracy in the setting with more than two data parties, we further propose a refined version of the weights estimation algorithm and a parameter tuning strategy to reduce the final\n            <jats:italic>k<\/jats:italic>\n            -means loss to be close to that in the central private setting. We provide theoretical utility analysis and experimental evaluation results for the cluster centers computed by our algorithm and show that our approach performs better both theoretically and empirically than the two baselines based on existing techniques.\n          <\/jats:p>","DOI":"10.14778\/3583140.3583146","type":"journal-article","created":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T16:45:59Z","timestamp":1682009159000},"page":"1277-1290","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Differentially Private Vertical Federated Clustering"],"prefix":"10.14778","volume":"16","author":[{"given":"Zitao","family":"Li","sequence":"first","affiliation":[{"name":"Purdue University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianhao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of Virginia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ninghui","family":"Li","sequence":"additional","affiliation":[{"name":"Purdue University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,4,20]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"California consumer privacy act. https:\/\/leginfo.legislature.ca.gov\/faces\/codes_displayText.xhtml?division=3.&part=4.&lawCode=CIV&title=1.81.5.  California consumer privacy act. https:\/\/leginfo.legislature.ca.gov\/faces\/codes_displayText.xhtml?division=3.&part=4.&lawCode=CIV&title=1.81.5."},{"key":"e_1_2_1_2_1","unstructured":"Eu general data protection regulation. https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/PDF\/?uri=CELEX:32016R0679.  Eu general data protection regulation. https:\/\/eur-lex.europa.eu\/legal-content\/EN\/TXT\/PDF\/?uri=CELEX:32016R0679."},{"key":"e_1_2_1_3_1","unstructured":"Home credit default risk. https:\/\/www.kaggle.com\/competitions\/home-credit-default-risk\/overview.  Home credit default risk. https:\/\/www.kaggle.com\/competitions\/home-credit-default-risk\/overview."},{"key":"e_1_2_1_4_1","unstructured":"New york city taxi trip. https:\/\/www.kaggle.com\/c\/nyc-taxi-trip-duration.  New york city taxi trip. https:\/\/www.kaggle.com\/c\/nyc-taxi-trip-duration."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-009-5103-0"},{"key":"e_1_2_1_7_1","first-page":"322","volume-title":"International Conference on Machine Learning","author":"Balcan M.-F.","year":"2017","unstructured":"M.-F. Balcan , T. Dick , Y. Liang , W. Mou , and H. Zhang . Differentially private clustering in high-dimensional euclidean spaces . In International Conference on Machine Learning , pages 322 -- 331 . PMLR, 2017 . M.-F. Balcan, T. Dick, Y. Liang, W. Mou, and H. Zhang. Differentially private clustering in high-dimensional euclidean spaces. In International Conference on Machine Learning, pages 322--331. PMLR, 2017."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065167.1065184"},{"key":"e_1_2_1_9_1","first-page":"267","volume-title":"28th USENIX Security Symposium (USENIX Security 19)","author":"Carlini N.","year":"2019","unstructured":"N. Carlini , C. Liu , \u00da. Erlingsson, J. Kos , and D. Song . The secret sharer: Evaluating and testing unintended memorization in neural networks . In 28th USENIX Security Symposium (USENIX Security 19) , pages 267 -- 284 , 2019 . N. Carlini, C. Liu, \u00da. Erlingsson, J. Kos, and D. Song. The secret sharer: Evaluating and testing unintended memorization in neural networks. In 28th USENIX Security Symposium (USENIX Security 19), pages 267--284, 2019."},{"key":"e_1_2_1_10_1","volume-title":"Locally private k-means in one round. arXiv preprint arXiv:2104.09734","author":"Chang A.","year":"2021","unstructured":"A. Chang , B. Ghazi , R. Kumar , and P. Manurangsi . Locally private k-means in one round. arXiv preprint arXiv:2104.09734 , 2021 . A. Chang, B. Ghazi, R. Kumar, and P. Manurangsi. Locally private k-means in one round. arXiv preprint arXiv:2104.09734, 2021."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_12_1","volume-title":"VAFL: a method of vertical asynchronous federated learning","author":"Chen T.","year":"2020","unstructured":"T. Chen , X. Jin , Y. Sun , and W. Yin . VAFL: a method of vertical asynchronous federated learning , 2020 . T. Chen, X. Jin, Y. Sun, and W. Yin. VAFL: a method of vertical asynchronous federated learning, 2020."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.2478\/popets-2020-0047"},{"key":"e_1_2_1_14_1","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","volume-title":"International Conference on Cryptology and Network Security","author":"Cristofaro E. D.","year":"2012","unstructured":"E. D. Cristofaro , P. Gasti , and G. Tsudik . Fast and private computation of cardinality of set intersection and union . In International Conference on Cryptology and Network Security , pages 218 -- 231 . Springer , 2012 . E. D. Cristofaro, P. Gasti, and G. Tsudik. Fast and private computation of cardinality of set intersection and union. In International Conference on Cryptology and Network Security, pages 218--231. Springer, 2012."},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.2478\/popets-2019-0018","article-title":"Cardinality estimators do not preserve privacy","volume":"2","author":"Desfontaines D.","year":"2019","unstructured":"D. Desfontaines , A. Lochbihler , and D. Basin . Cardinality estimators do not preserve privacy . Proceedings on Privacy Enhancing Technologies , 2 : 26 -- 46 , 2019 . D. Desfontaines, A. Lochbihler, and D. Basin. Cardinality estimators do not preserve privacy. Proceedings on Privacy Enhancing Technologies, 2:26--46, 2019.","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"e_1_2_1_16_1","volume-title":"(nearly) all cardinality estimators are differentially private","author":"Dickens C.","year":"2022","unstructured":"C. Dickens , J. Thaler , and D. Ting . (nearly) all cardinality estimators are differentially private , 2022 . C. Dickens, J. Thaler, and D. Ting. (nearly) all cardinality estimators are differentially private, 2022."},{"key":"e_1_2_1_17_1","volume-title":"New directions in cryptography","author":"W.","year":"1976","unstructured":"W. DIFFIE and M. E. HELLMAN. New directions in cryptography . IEEE TRANSACTIONS ON INFORMATION THEORY , 22(6), 1976 . W. DIFFIE and M. E. HELLMAN. New directions in cryptography. IEEE TRANSACTIONS ON INFORMATION THEORY, 22(6), 1976."},{"key":"e_1_2_1_18_1","first-page":"1339","volume-title":"International Conference on Machine Learning","author":"Ding H.","year":"2016","unstructured":"H. Ding , Y. Liu , L. Huang , and J. Li . K-means clustering with distributed dimensions . In International Conference on Machine Learning , pages 1339 -- 1348 . PMLR, 2016 . H. Ding, Y. Liu, L. Huang, and J. Li. K-means clustering with distributed dimensions. In International Conference on Machine Learning, pages 1339--1348. PMLR, 2016."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_32"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-060116-054123"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536465"},{"key":"e_1_2_1_23_1","first-page":"137","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"Flajolet P.","year":"2007","unstructured":"P. Flajolet , \u00c9. Fusy, O. Gandouet , and F. Meunier . Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm . In Discrete Mathematics and Theoretical Computer Science , pages 137 -- 156 . Discrete Mathematics and Theoretical Computer Science , 2007 . P. Flajolet, \u00c9. Fusy, O. Gandouet, and F. Meunier. Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm. In Discrete Mathematics and Theoretical Computer Science, pages 137--156. Discrete Mathematics and Theoretical Computer Science, 2007."},{"key":"e_1_2_1_24_1","volume-title":"Probabilistic counting algorithms for data base applications. Journal of computer and system sciences, 31(2):182--209","author":"Flajolet P.","year":"1985","unstructured":"P. Flajolet and G. N. Martin . Probabilistic counting algorithms for data base applications. Journal of computer and system sciences, 31(2):182--209 , 1985 . P. Flajolet and G. N. Martin. Probabilistic counting algorithms for data base applications. Journal of computer and system sciences, 31(2):182--209, 1985."},{"key":"e_1_2_1_25_1","first-page":"1","volume-title":"International conference on the theory and applications of cryptographic techniques","author":"Freedman M. J.","year":"2004","unstructured":"M. J. Freedman , K. Nissim , and B. Pinkas . Efficient private matching and set intersection . In International conference on the theory and applications of cryptographic techniques , pages 1 -- 19 . Springer , 2004 . M. J. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In International conference on the theory and applications of cryptographic techniques, pages 1--19. Springer, 2004."},{"key":"e_1_2_1_26_1","first-page":"33","article-title":"Differentially private clustering: Tight approximation ratios","author":"Ghazi B.","year":"2020","unstructured":"B. Ghazi , R. Kumar , and P. Manurangsi . Differentially private clustering: Tight approximation ratios . Advances in Neural Information Processing Systems , 33 , 2020 . B. Ghazi, R. Kumar, and P. Manurangsi. Differentially private clustering: Tight approximation ratios. Advances in Neural Information Processing Systems, 33, 2020.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_27_1","volume-title":"Differentially private k-means clustering (experimental). https:\/\/github.com\/google\/differential-privacy\/tree\/main\/learning\/clustering","year":"2022","unstructured":"Google. Differentially private k-means clustering (experimental). https:\/\/github.com\/google\/differential-privacy\/tree\/main\/learning\/clustering , 2022 . Google. Differentially private k-means clustering (experimental). https:\/\/github.com\/google\/differential-privacy\/tree\/main\/learning\/clustering, 2022."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings on Privacy Enhancing Technologies","author":"Groce A.","year":"2019","unstructured":"A. Groce , P. Rindal , and M. Rosulek . Cheaper private set intersection via differentially private leakage . Proceedings on Privacy Enhancing Technologies , 2019(3), 2019 . A. Groce, P. Rindal, and M. Rosulek. Cheaper private set intersection via differentially private leakage. Proceedings on Privacy Enhancing Technologies, 2019(3), 2019."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403298"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2018.05.003"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007400"},{"key":"e_1_2_1_32_1","volume-title":"Algorithm as 136: A k-means clustering algorithm. Journal of the royal statistical society. series c (applied statistics), 28(1):100--108","author":"Hartigan J. A.","year":"1979","unstructured":"J. A. Hartigan and M. A. Wong . Algorithm as 136: A k-means clustering algorithm. Journal of the royal statistical society. series c (applied statistics), 28(1):100--108 , 1979 . J. A. Hartigan and M. A. Wong. Algorithm as 136: A k-means clustering algorithm. Journal of the royal statistical society. series c (applied statistics), 28(1):100--108, 1979."},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-540-78524-8_10","volume-title":"Theory of Cryptography Conference","author":"Hazay C.","year":"2008","unstructured":"C. Hazay and Y. Lindell . Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries . In Theory of Cryptography Conference , pages 155 -- 175 . Springer , 2008 . C. Hazay and Y. Lindell. Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In Theory of Cryptography Conference, pages 155--175. Springer, 2008."},{"key":"e_1_2_1_34_1","first-page":"312","volume-title":"International Workshop on Public Key Cryptography","author":"Hazay C.","year":"2010","unstructured":"C. Hazay and K. Nissim . Efficient set operations in the presence of malicious adversaries . In International Workshop on Public Key Cryptography , pages 312 -- 331 . Springer , 2010 . C. Hazay and K. Nissim. Efficient set operations in the presence of malicious adversaries. In International Workshop on Public Key Cryptography, pages 312--331. Springer, 2010."},{"key":"e_1_2_1_35_1","first-page":"965","volume-title":"30th USENIX Security Symposium (USENIX Security 21)","author":"Hu C.","year":"2021","unstructured":"C. Hu , J. Li , Z. Liu , X. Guo , Y. Wei , X. Guang , G. Loukides , and C. Dong . How to make private distributed cardinality estimation practical, and get differential privacy for free . In 30th USENIX Security Symposium (USENIX Security 21) , pages 965 -- 982 , 2021 . C. Hu, J. Li, Z. Liu, X. Guo, Y. Wei, X. Guang, G. Loukides, and C. Dong. How to make private distributed cardinality estimation practical, and get differential privacy for free. In 30th USENIX Security Symposium (USENIX Security 21), pages 965--982, 2021."},{"key":"e_1_2_1_36_1","volume-title":"Learning privately over distributed features: An admm sharing approach","author":"Hu Y.","year":"2019","unstructured":"Y. Hu , P. Liu , L. Kong , and D. Niu . Learning privately over distributed features: An admm sharing approach , 2019 . Y. Hu, P. Liu, L. Kong, and D. Niu. Learning privately over distributed features: An admm sharing approach, 2019."},{"key":"e_1_2_1_37_1","doi-asserted-by":"crossref","first-page":"2232","DOI":"10.1145\/3292500.3330765","volume-title":"Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD '19","author":"Hu Y.","year":"2019","unstructured":"Y. Hu , D. Niu , J. Yang , and S. Zhou . FDML: A collaborative machine learning framework for distributed features . In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD '19 , page 2232 -- 2240 , New York, NY, USA , 2019 . Association for Computing Machinery. Y. Hu, D. Niu, J. Yang, and S. Zhou. FDML: A collaborative machine learning framework for distributed features. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, KDD '19, page 2232--2240, New York, NY, USA, 2019. Association for Computing Machinery."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196977"},{"key":"e_1_2_1_39_1","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/978-3-642-00457-5_34","volume-title":"Theory of Cryptography Conference","author":"Jarecki S.","year":"2009","unstructured":"S. Jarecki and X. Liu . Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection . In Theory of Cryptography Conference , pages 577 -- 594 . Springer , 2009 . S. Jarecki and X. Liu. Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection. In Theory of Cryptography Conference, pages 577--594. Springer, 2009."},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1109\/EuroSP48549.2020.00032","volume-title":"2020 IEEE European Symposium on Security and Privacy (EuroS&P)","author":"Kacsmar B.","year":"2020","unstructured":"B. Kacsmar , B. Khurram , N. Lukas , A. Norton , M. Shafieinejad , Z. Shang , Y. Baseri , M. Sepehri , S. Oya , and F. Kerschbaum . Differentially private two-party set operations . In 2020 IEEE European Symposium on Security and Privacy (EuroS&P) , pages 390 -- 404 . IEEE, 2020 . B. Kacsmar, B. Khurram, N. Lukas, A. Norton, M. Shafieinejad, Z. Shang, Y. Baseri, M. Sepehri, S. Oya, and F. Kerschbaum. Differentially private two-party set operations. In 2020 IEEE European Symposium on Security and Privacy (EuroS&P), pages 390--404. IEEE, 2020."},{"key":"e_1_2_1_41_1","volume-title":"Advances and open problems in federated learning. Foundations and Trends\u00ae in Machine Learning, 14(1--2):1--210","author":"Kairouz P.","year":"2021","unstructured":"P. Kairouz , H. B. McMahan , B. Avent , A. Bellet , M. Bennis , A. N. Bhagoji , K. Bonawitz , Z. Charles , G. Cormode , R. Cummings , Advances and open problems in federated learning. Foundations and Trends\u00ae in Machine Learning, 14(1--2):1--210 , 2021 . P. Kairouz, H. B. McMahan, B. Avent, A. Bellet, M. Bennis, A. N. Bhagoji, K. Bonawitz, Z. Charles, G. Cormode, R. Cummings, et al. Advances and open problems in federated learning. Foundations and Trends\u00ae in Machine Learning, 14(1--2):1--210, 2021."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535218_15"},{"key":"e_1_2_1_43_1","volume-title":"Privacy-preserving secure cardinality and frequency estimation","author":"Kreuter B.","year":"2020","unstructured":"B. Kreuter , C. W. Wright , E. S. Skvortsov , R. Mirisola , and Y. Wang . Privacy-preserving secure cardinality and frequency estimation . 2020 . B. Kreuter, C. W. Wright, E. S. Skvortsov, R. Mirisola, and Y. Wang. Privacy-preserving secure cardinality and frequency estimation. 2020."},{"key":"e_1_2_1_44_1","volume-title":"an even more nearly optimal cardinality estimation algorithm. arXiv preprint arXiv:1708.06839","author":"Lang K. J.","year":"2017","unstructured":"K. J. Lang . Back to the future : an even more nearly optimal cardinality estimation algorithm. arXiv preprint arXiv:1708.06839 , 2017 . K. J. Lang. Back to the future: an even more nearly optimal cardinality estimation algorithm. arXiv preprint arXiv:1708.06839, 2017."},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3422337.3447836"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.14778\/3503585.3503598"},{"key":"e_1_2_1_47_1","volume-title":"Differentially private vertical federated clustering. arXiv preprint arXiv:2208.01700","author":"Li Z.","year":"2022","unstructured":"Z. Li , T. Wang , and N. Li . Differentially private vertical federated clustering. arXiv preprint arXiv:2208.01700 , 2022 . Z. Li, T. Wang, and N. Li. Differentially private vertical federated clustering. arXiv preprint arXiv:2208.01700, 2022."},{"key":"e_1_2_1_48_1","article-title":"Federated forest","author":"Liu Y.","year":"2020","unstructured":"Y. Liu , Y. Liu , Z. Liu , Y. Liang , C. Meng , J. Zhang , and Y. Zheng . Federated forest . IEEE Transactions on Big Data, (01):1--1 , 2020 . Y. Liu, Y. Liu, Z. Liu, Y. Liang, C. Meng, J. Zhang, and Y. Zheng. Federated forest. IEEE Transactions on Big Data, (01):1--1, 2020.","journal-title":"IEEE Transactions on Big Data, (01):1--1"},{"key":"e_1_2_1_49_1","first-page":"281","volume-title":"Proceedings of the fifth Berkeley symposium on mathematical statistics and probability","volume":"1","author":"MacQueen J.","year":"1967","unstructured":"J. MacQueen Some methods for classification and analysis of multivariate observations . In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability , volume 1 , pages 281 -- 297 . Oakland, CA, USA , 1967 . J. MacQueen et al. Some methods for classification and analysis of multivariate observations. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, volume 1, pages 281--297. Oakland, CA, USA, 1967."},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004540010019"},{"key":"e_1_2_1_51_1","series-title":"Proceedings of Machine Learning Research","first-page":"1273","volume-title":"Proceedings of the 20th International Conference on Artificial Intelligence and Statistics","author":"McMahan B.","year":"2017","unstructured":"B. McMahan , E. Moore , D. Ramage , S. Hampson , and B. A. y. Arcas. Communication-Efficient Learning of Deep Networks from Decentralized Data . In A. Singh and J. Zhu, editors, Proceedings of the 20th International Conference on Artificial Intelligence and Statistics , volume 54 of Proceedings of Machine Learning Research , pages 1273 -- 1282 , USA, 20--22 Apr 2017 . PMLR. B. McMahan, E. Moore, D. Ramage, S. Hampson, and B. A. y. Arcas. Communication-Efficient Learning of Deep Networks from Decentralized Data. In A. Singh and J. Zhu, editors, Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, volume 54 of Proceedings of Machine Learning Research, pages 1273--1282, USA, 20--22 Apr 2017. PMLR."},{"key":"e_1_2_1_52_1","volume-title":"International Conference on Learning Representations. OpenReview.net","author":"McMahan H. B.","year":"2018","unstructured":"H. B. McMahan , D. Ramage , K. Talwar , and L. Zhang . Learning differentially private recurrent language models . In International Conference on Learning Representations. OpenReview.net , 2018 . H. B. McMahan, D. Ramage, K. Talwar, and L. Zhang. Learning differentially private recurrent language models. In International Conference on Learning Representations. OpenReview.net, 2018."},{"key":"e_1_2_1_53_1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1109\/CSF.2017.11","volume-title":"R\u00e9nyi differential privacy. In 2017 IEEE 30th computer security foundations symposium (CSF)","author":"Mironov I.","year":"2017","unstructured":"I. Mironov . R\u00e9nyi differential privacy. In 2017 IEEE 30th computer security foundations symposium (CSF) , pages 263 -- 275 . IEEE , 2017 . I. Mironov. R\u00e9nyi differential privacy. In 2017 IEEE 30th computer security foundations symposium (CSF), pages 263--275. IEEE, 2017."},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_2_1_55_1","first-page":"619","volume-title":"Algorithmic Learning Theory","author":"Nissim K.","year":"2018","unstructured":"K. Nissim and U. Stemmer . Clustering algorithms for the centralized and local models . In Algorithmic Learning Theory , pages 619 -- 653 . PMLR, 2018 . K. Nissim and U. Stemmer. Clustering algorithms for the centralized and local models. In Algorithmic Learning Theory, pages 619--653. PMLR, 2018."},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2902251.2902296"},{"key":"e_1_2_1_57_1","first-page":"1","volume-title":"24th International Conference on Database Theory, ICDT 2021, March 23-26","volume":"186","author":"Pagh R.","year":"2021","unstructured":"R. Pagh and N. M. Stausholm . Efficient differentially private F0 linear sketching . In 24th International Conference on Database Theory, ICDT 2021, March 23-26 , 2021 , Nicosia, Cyprus , volume 186 of LIPIcs, pages 18: 1 -- 18 :19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2021. R. Pagh and N. M. Stausholm. Efficient differentially private F0 linear sketching. In 24th International Conference on Database Theory, ICDT 2021, March 23-26, 2021, Nicosia, Cyprus, volume 186 of LIPIcs, pages 18:1--18:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2021."},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_2_1_59_1","first-page":"410","volume-title":"Proceedings of the 2007 joint conference on empirical methods in natural language processing and computational natural language learning (EMNLP-CoNLL)","author":"Rosenberg A.","year":"2007","unstructured":"A. Rosenberg and J. Hirschberg . V-measure: A conditional entropy-based external cluster evaluation measure . In Proceedings of the 2007 joint conference on empirical methods in natural language processing and computational natural language learning (EMNLP-CoNLL) , pages 410 -- 420 , 2007 . A. Rosenberg and J. Hirschberg. V-measure: A conditional entropy-based external cluster evaluation measure. In Proceedings of the 2007 joint conference on empirical methods in natural language processing and computational natural language learning (EMNLP-CoNLL), pages 410--420, 2007."},{"key":"e_1_2_1_60_1","volume-title":"a graphical aid to the interpretation and validation of cluster analysis. Journal of computational and applied mathematics, 20:53--65","author":"Rousseeuw P. J.","year":"1987","unstructured":"P. J. Rousseeuw . Silhouettes : a graphical aid to the interpretation and validation of cluster analysis. Journal of computational and applied mathematics, 20:53--65 , 1987 . P. J. Rousseeuw. Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. Journal of computational and applied mathematics, 20:53--65, 1987."},{"key":"e_1_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.41"},{"key":"e_1_2_1_62_1","unstructured":"D. J. Slate. Letter recognition data set. https:\/\/archive.ics.uci.edu\/ml\/datasets\/letter+recognition.  D. J. Slate. Letter recognition data set. https:\/\/archive.ics.uci.edu\/ml\/datasets\/letter+recognition."},{"key":"e_1_2_1_63_1","volume-title":"The flajolet-martin sketch itself preserves differential privacy: Private counting with minimal space. Advances in Neural Information Processing Systems 33 pre-proceedings (NeurIPS","author":"Smith A.","year":"2020","unstructured":"A. Smith , S. Song , and A. Thakurta . The flajolet-martin sketch itself preserves differential privacy: Private counting with minimal space. Advances in Neural Information Processing Systems 33 pre-proceedings (NeurIPS 2020 ), 2020. A. Smith, S. Song, and A. Thakurta. The flajolet-martin sketch itself preserves differential privacy: Private counting with minimal space. Advances in Neural Information Processing Systems 33 pre-proceedings (NeurIPS 2020), 2020."},{"key":"e_1_2_1_64_1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/PAC.2017.43","volume-title":"2017 IEEE Symposium on Privacy-Aware Computing (PAC)","author":"Stanojevic R.","year":"2017","unstructured":"R. Stanojevic , M. Nabeel , and T. Yu . Distributed cardinality estimation of set operations with differential privacy . In 2017 IEEE Symposium on Privacy-Aware Computing (PAC) , pages 37 -- 48 . IEEE, 2017 . R. Stanojevic, M. Nabeel, and T. Yu. Distributed cardinality estimation of set operations with differential privacy. In 2017 IEEE Symposium on Privacy-Aware Computing (PAC), pages 37--48. IEEE, 2017."},{"key":"e_1_2_1_65_1","volume-title":"NeurIPS","author":"Stemmer U.","year":"2018","unstructured":"U. Stemmer and H. Kaplan . Differentially private k-means with constant multiplicative error . In NeurIPS , 2018 . U. Stemmer and H. Kaplan. Differentially private k-means with constant multiplicative error. In NeurIPS, 2018."},{"key":"e_1_2_1_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/2857705.2857708"},{"key":"e_1_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956776"},{"key":"e_1_2_1_68_1","first-page":"139","volume-title":"IFIP Annual Conference on Data and Applications Security and Privacy","author":"Vaidya J.","year":"2005","unstructured":"J. Vaidya and C. Clifton . Privacy-preserving decision trees over vertically partitioned data . In IFIP Annual Conference on Data and Applications Security and Privacy , pages 139 -- 152 . Springer , 2005 . J. Vaidya and C. Clifton. Privacy-preserving decision trees over vertically partitioned data. In IFIP Annual Conference on Data and Applications Security and Privacy, pages 139--152. Springer, 2005."},{"key":"e_1_2_1_69_1","volume-title":"Hybrid differentially private federated learning on vertically partitioned data. arXiv preprint arXiv:2009.02763","author":"Wang C.","year":"2020","unstructured":"C. Wang , J. Liang , M. Huang , B. Bai , K. Bai , and H. Li . Hybrid differentially private federated learning on vertically partitioned data. arXiv preprint arXiv:2009.02763 , 2020 . C. Wang, J. Liang, M. Huang, B. Bai, K. Bai, and H. Li. Hybrid differentially private federated learning on vertically partitioned data. arXiv preprint arXiv:2009.02763, 2020."},{"key":"e_1_2_1_70_1","first-page":"729","volume-title":"26th USENIX Security Symposium, USENIX Security 2017","author":"Wang T.","year":"2017","unstructured":"T. Wang , J. Blocki , N. Li , and S. Jha . Locally differentially private protocols for frequency estimation . In 26th USENIX Security Symposium, USENIX Security 2017 , Vancouver, BC, Canada , August 16-18, 2017 ., pages 729 -- 745 , 2017. T. Wang, J. Blocki, N. Li, and S. Jha. Locally differentially private protocols for frequency estimation. In 26th USENIX Security Symposium, USENIX Security 2017, Vancouver, BC, Canada, August 16-18, 2017., pages 729--745, 2017."},{"key":"e_1_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319891"},{"key":"e_1_2_1_72_1","first-page":"28","article-title":"Differentially private subspace clustering","author":"Wang Y.","year":"2015","unstructured":"Y. Wang , Y.-X. Wang , and A. Singh . Differentially private subspace clustering . Advances in Neural Information Processing Systems , 28 , 2015 . Y. Wang, Y.-X. Wang, and A. Singh. Differentially private subspace clustering. Advances in Neural Information Processing Systems, 28, 2015.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_2_1_73_1","volume-title":"Webank use case. https:\/\/www.fedai.org\/cases\/a-case-of-traffic-violations-insurance-using-federated-learning\/","year":"2022","unstructured":"WeBank. Webank use case. https:\/\/www.fedai.org\/cases\/a-case-of-traffic-violations-insurance-using-federated-learning\/ , 2022 . WeBank. Webank use case. https:\/\/www.fedai.org\/cases\/a-case-of-traffic-violations-insurance-using-federated-learning\/, 2022."},{"key":"e_1_2_1_74_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2020.2988575"},{"key":"e_1_2_1_75_1","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1109\/SP40000.2020.00025","volume-title":"2020 IEEE Symposium on Security and Privacy (SP)","author":"Wu N.","year":"2020","unstructured":"N. Wu , F. Farokhi , D. Smith , and M. A. Kaafar . The value of collaboration in convex machine learning with differential privacy . In 2020 IEEE Symposium on Security and Privacy (SP) , pages 304 -- 317 , New York, NY, USA , 2020 . IEEE. N. Wu, F. Farokhi, D. Smith, and M. A. Kaafar. The value of collaboration in convex machine learning with differential privacy. In 2020 IEEE Symposium on Security and Privacy (SP), pages 304--317, New York, NY, USA, 2020. IEEE."},{"issue":"11","key":"e_1_2_1_76_1","doi-asserted-by":"crossref","first-page":"2090","DOI":"10.14778\/3407790.3407811","article-title":"Privacy preserving vertical federated learning for tree-based models","volume":"13","author":"Wu Y.","year":"2020","unstructured":"Y. Wu , S. Cai , X. Xiao , G. Chen , and B. C. Ooi . Privacy preserving vertical federated learning for tree-based models . Proceedings of the VLDB Endowment , 13 ( 11 ): 2090 -- 2103 , 2020 . Y. Wu, S. Cai, X. Xiao, G. Chen, and B. C. Ooi. Privacy preserving vertical federated learning for tree-based models. Proceedings of the VLDB Endowment, 13(11):2090--2103, 2020.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_2_1_77_1","volume-title":"Improving privacy-preserving vertical federated learning by efficient communication with admm. arXiv preprint arXiv:2207.10226","author":"Xie C.","year":"2022","unstructured":"C. Xie , P.-Y. Chen , C. Zhang , and B. Li . Improving privacy-preserving vertical federated learning by efficient communication with admm. arXiv preprint arXiv:2207.10226 , 2022 . C. Xie, P.-Y. Chen, C. Zhang, and B. Li. Improving privacy-preserving vertical federated learning by efficient communication with admm. arXiv preprint arXiv:2207.10226, 2022."},{"key":"e_1_2_1_78_1","first-page":"543","volume-title":"Privacy-preserving svm classification on vertically partitioned data without secure multi-party computation. In 2009 fifth international conference on natural computation","author":"Yunhong H.","year":"2009","unstructured":"H. Yunhong , F. Liang , and H. Guoping . Privacy-preserving svm classification on vertically partitioned data without secure multi-party computation. In 2009 fifth international conference on natural computation , volume 1 , pages 543 -- 546 . IEEE , 2009 . H. Yunhong, F. Liang, and H. Guoping. Privacy-preserving svm classification on vertically partitioned data without secure multi-party computation. In 2009 fifth international conference on natural computation, volume 1, pages 543--546. IEEE, 2009."},{"key":"e_1_2_1_79_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.00033"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3583140.3583146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,20]],"date-time":"2023-04-20T17:01:17Z","timestamp":1682010077000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3583140.3583146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2]]},"references-count":79,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10.14778\/3583140.3583146"],"URL":"https:\/\/doi.org\/10.14778\/3583140.3583146","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2023,2]]},"assertion":[{"value":"2023-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}