{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,15]],"date-time":"2025-10-15T18:13:38Z","timestamp":1760552018249,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031455124"},{"type":"electronic","value":"9783031455131"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-45513-1_19","type":"book-chapter","created":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T22:01:53Z","timestamp":1696975313000},"page":"345-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Privacy Preserving Outsourced K-means Clustering Using Kd-tree"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7604-1405","authenticated-orcid":false,"given":"Yanxiang","family":"Deng","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5930-8881","authenticated-orcid":false,"given":"Lin","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7275-8190","authenticated-orcid":false,"given":"Shaojing","family":"Fu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0720-4925","authenticated-orcid":false,"given":"Yuchuan","family":"Luo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1424-1414","authenticated-orcid":false,"given":"Wei","family":"Wu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0008-8420-1315","authenticated-orcid":false,"given":"Shixiong","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,10,11]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0933-3657(98)00069-4","volume":"16","author":"F Masulli","year":"1999","unstructured":"Masulli, F., Schenone, A.: A fuzzy clustering based segmentation system as support to diagnosis in medical imaging. Artif. Intell. Med. 16(2), 129\u2013147 (1999)","journal-title":"Artif. Intell. Med."},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1177\/002224379703400306","volume":"34","author":"A Chaturvedi","year":"1997","unstructured":"Chaturvedi, A., Carroll, J.D., Green, P.E., Rotondo, J.A.: A feature-based approach to market segmentation via overlapping k-centroids clustering. J. Mark. Res. 34(3), 370\u2013377 (1997)","journal-title":"J. Mark. Res."},{"issue":"10","key":"19_CR3","doi-asserted-by":"publisher","first-page":"3424","DOI":"10.1109\/TKDE.2020.2969633","volume":"33","author":"W Wu","year":"2020","unstructured":"Wu, W., Liu, J., Wang, H., Hao, J., Xian, M.: Secure and efficient outsourced k-means clustering using fully homomorphic encryption with ciphertext packing technique. IEEE Trans. Knowl. Data Eng. 33(10), 3424\u20133437 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"4","key":"19_CR4","first-page":"414","volume":"2020","author":"P Mohassel","year":"2020","unstructured":"Mohassel, P., Rosulek, M., Trieu, N.: Practical privacy-preserving k-means clustering. Proc. Priv. Enh. Technol. 2020(4), 414\u2013433 (2020)","journal-title":"Proc. Priv. Enh. Technol."},{"key":"19_CR5","unstructured":"Naeem, M., Asghar, S.: KEGG metabolic reaction network data set. The UCI KDD Archive (2011)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Rong, H., Wang, H., Liu, J., Hao, J., Xian, M.: Privacy-preserving-means clustering under multiowner setting in distributed cloud environments. Secur. Commun. Netw. 2017 (2017)","DOI":"10.1155\/2017\/3910126"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Rao, F.-Y., Samanthula, B.K., Bertino, E., Yi, X., Liu, D.: Privacy-preserving and outsourced multi-user k-means clustering. In: 2015 IEEE Conference on Collaboration and Internet Computing (CIC), pp. 80\u201389. IEEE (2015)","DOI":"10.1109\/CIC.2015.20"},{"issue":"7","key":"19_CR8","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TPAMI.2002.1017616","volume":"24","author":"T Kanungo","year":"2002","unstructured":"Kanungo, T., Mount, D.M., Netanyahu, N.S., Piatko, C.D., Silverman, R., Wu, A.Y.: An efficient k-means clustering algorithm: analysis and implementation. IEEE Trans. Pattern Anal. Mach. Intell. 24(7), 881\u2013892 (2002)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Rathee, D., et al.: Cryptflow2: practical 2-party secure inference. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 325\u2013342 (2020)","DOI":"10.1145\/3372297.3417274"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Gheid, Z., Challal, Y.: Efficient and privacy-preserving k-means clustering for big data mining. In: 2016 IEEE Trustcom\/BigDataSE\/ISPA, pp. 791\u2013798. IEEE (2016)","DOI":"10.1109\/TrustCom.2016.0140"},{"key":"19_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-030-10970-7_21","volume-title":"Selected Areas in Cryptography","author":"A J\u00e4schke","year":"2018","unstructured":"J\u00e4schke, A., Armknecht, F.: Unsupervised machine learning on encrypted data. In: Cid, C., Jacobson, M., Jr. (eds.) SAC 2018. LNCS, vol. 11349, pp. 453\u2013478. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_21"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Liu, X., et al.: Outsourcing two-party privacy preserving k-means clustering protocol in wireless sensor networks. In: 2015 11th International Conference on Mobile Ad-hoc and Sensor Networks (MSN), pp. 124\u2013133. IEEE (2015)","DOI":"10.1109\/MSN.2015.42"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Liu, D., Bertino, E., Yi, X.: Privacy of outsourced k-means clustering. In: Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, pp. 123\u2013134 (2014)","DOI":"10.1145\/2590296.2590332"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Kim, H.-J., Chang, J.-W.: A privacy-preserving k-means clustering algorithm using secure comparison protocol and density-based center point selection. In: 2018 IEEE 11th International Conference on Cloud Computing (CLOUD), pp. 928\u2013931. IEEE (2018)","DOI":"10.1109\/CLOUD.2018.00138"},{"key":"19_CR15","unstructured":"Kargupta, H., Datta, S., Wang, Q., Sivakumar, K.: On the privacy preserving properties of random data perturbation techniques. In: Third IEEE International Conference on Data Mining, pp. 99\u2013106. IEEE (2003)"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Doganay, M.C., Pedersen, T.B., Saygin, Y., Sava\u015f, E., Levi, A.: Distributed privacy preserving k-means clustering with additive secret sharing. In: Proceedings of the 2008 International Workshop on Privacy and Anonymity in Information Society, pp. 3\u201311 (2008)","DOI":"10.1145\/1379287.1379291"},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"Lin, Z., Jaromczyk, J.W.: Privacy preserving two-party k-means clustering over vertically partitioned dataset. In: Proceedings of 2011 IEEE International Conference on Intelligence and Security Informatics, pp. 187\u2013191. IEEE (2011)","DOI":"10.1109\/ISI.2011.5983998"},{"issue":"3","key":"19_CR18","first-page":"328","volume":"17","author":"SJ Patel","year":"2015","unstructured":"Patel, S.J., Punjani, D., Jinwala, D.C.: An efficient approach for privacy preserving distributed clustering in semi-honest model using elliptic curve cryptography. Int. J. Netw. Secur. 17(3), 328\u2013339 (2015)","journal-title":"Int. J. Netw. Secur."},{"issue":"2","key":"19_CR19","first-page":"1","volume":"8","author":"X Chen","year":"2016","unstructured":"Chen, X.: Introduction to secure outsourcing computation. Synth. Lect. Inf. Secur. Priv. Trust 8(2), 1\u201393 (2016)","journal-title":"Synth. Lect. Inf. Secur. Priv. Trust"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Encryption schemes. The foundations of cryptography, vol. 2 (2004)","DOI":"10.1017\/CBO9780511721656"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: a framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol. 5283, pp. 192\u2013206. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88313-5_13"},{"issue":"6","key":"19_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D Bogdanov","year":"2012","unstructured":"Bogdanov, D., Niitsoo, M., Toft, T., Willemson, J.: High-performance secure multi-party computation for data mining applications. Int. J. Inf. Secur. 11(6), 403\u2013418 (2012)","journal-title":"Int. J. Inf. Secur."},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-46766-1_34","volume-title":"Advances in Cryptology \u2014 CRYPTO \u201991","author":"D Beaver","year":"1992","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 420\u2013432. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-46766-1_34"},{"key":"19_CR24","unstructured":"El Malki, N., Ravat, F., Teste, O.: KD-means: clustering method for massive data based on KD-tree. In: 22nd International Workshop on Design, Optimization, Languages and Analytical Processing of Big Data-DOLAP 2020, vol. 2572. CEUR-WS (2020)"},{"issue":"1","key":"19_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover, T., Hart, P.: Nearest neighbor pattern classification. IEEE Trans. Inf. Theory 13(1), 21\u201327 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"19_CR26","doi-asserted-by":"publisher","first-page":"9841","DOI":"10.1109\/JIOT.2019.2932444","volume":"6","author":"L Liu","year":"2019","unstructured":"Liu, L., et al.: Toward highly secure yet efficient KNN classification scheme on outsourced cloud data. IEEE Internet Things J. 6(6), 9841\u20139852 (2019)","journal-title":"IEEE Internet Things J."},{"key":"19_CR27","doi-asserted-by":"crossref","unstructured":"Cheng, K., Hou, Y., Wang, L.: Secure similar sequence query on outsourced genomic data. In: Proceedings of the 2018 on Asia Conference on Computer and Communications Security, pp. 237\u2013251 (2018)","DOI":"10.1145\/3196494.3196535"},{"issue":"11","key":"19_CR28","doi-asserted-by":"publisher","first-page":"2401","DOI":"10.1109\/TIFS.2016.2573770","volume":"11","author":"X Liu","year":"2016","unstructured":"Liu, X., Deng, R.H., Choo, K.-K.R., Weng, J.: An efficient privacy-preserving outsourced calculation toolkit with multiple keys. IEEE Trans. Inf. Forensics Secur. 11(11), 2401\u20132414 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"12","key":"19_CR29","doi-asserted-by":"publisher","first-page":"4743","DOI":"10.1007\/s10489-018-1238-7","volume":"48","author":"P Fr\u00e4nti","year":"2018","unstructured":"Fr\u00e4nti, P., Sieranoja, S.: K-means properties on six clustering benchmark datasets. Appl. Intell. 48(12), 4743\u20134759 (2018)","journal-title":"Appl. Intell."},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: a survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol. 6639, pp. 11\u201346. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20901-7_2"},{"key":"19_CR31","doi-asserted-by":"crossref","unstructured":"Papernot, N., McDaniel, P., Sinha, A., Wellman, M.P.: SoK: security and privacy in machine learning. In: 2018 IEEE European Symposium on Security and Privacy (EuroS&P), pp. 399\u2013414. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00035"},{"issue":"3","key":"19_CR32","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1109\/TNN.2005.845141","volume":"16","author":"R Xu","year":"2005","unstructured":"Xu, R., Wunsch, D.: Survey of clustering algorithms. IEEE Trans. Neural Networks 16(3), 645\u2013678 (2005)","journal-title":"IEEE Trans. Neural Networks"},{"issue":"4","key":"19_CR33","first-page":"225","volume":"2021","author":"A Hegde","year":"2021","unstructured":"Hegde, A., M\u00f6llering, H., Schneider, T., Yalame, H.: SoK: efficient privacy-preserving clustering. Proc. Priv. Enh. Technol. 2021(4), 225\u2013248 (2021)","journal-title":"Proc. Priv. Enh. Technol."},{"key":"19_CR34","doi-asserted-by":"crossref","unstructured":"Bozdemir, B., Canard, S., Ermis, O., M\u00f6llering, H., \u00d6nen, M., Schneider, T.: Privacy-preserving density-based clustering. In: Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security, pp. 658\u2013671 (2021)","DOI":"10.1145\/3433210.3453104"},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Boldyreva, A., Tang, T.: Privacy-preserving approximate k-nearest-neighbors search that hides access, query and volume patterns. Cryptology ePrint Archive (2021)","DOI":"10.2478\/popets-2021-0084"}],"container-title":["Lecture Notes in Computer Science","Provable and Practical Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45513-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,11]],"date-time":"2023-10-11T00:04:21Z","timestamp":1696982661000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45513-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031455124","9783031455131"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45513-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"11 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ProvSec","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Provable Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuhan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"provsec2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/provsec2023.github.io\/ProvSec2023\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"20","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}