{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:38:48Z","timestamp":1764571128395,"version":"3.40.3"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031547690"},{"type":"electronic","value":"9783031547706"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-54770-6_9","type":"book-chapter","created":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T09:03:42Z","timestamp":1709197422000},"page":"213-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Clustering on\u00a0Encrypted Data"],"prefix":"10.1007","author":[{"given":"Mengyu","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Long","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Xiaoping","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhuotao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Yisong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Han","family":"Bao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,1]]},"reference":[{"key":"9_CR1","unstructured":"Lattigo v4, August 2022. https:\/\/github.com\/tuneinsight\/lattigo, ePFL-LDS, Tune Insight SA"},{"key":"9_CR2","unstructured":"Pytorch cifar models, August 2022. https:\/\/github.com\/chenyaofo\/pytorch-cifar-models"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1007\/978-3-319-64283-3_20","volume-title":"Big Data Analytics and Knowledge Discovery","author":"N Almutairi","year":"2017","unstructured":"Almutairi, N., Coenen, F., Dures, K.: K-means clustering using homomorphic encryption and an updatable distance matrix: secure third party data clustering with limited data owner interaction. In: Bellatreche, L., Chakravarthy, S. (eds.) DaWaK 2017. LNCS, vol. 10440, pp. 274\u2013285. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64283-3_20"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Ashari, I., Banjarnahor, R., Farida, D., Aisyah, S., Dewi, A., Humaya, N.: Application of data mining with the k-means clustering method and davies bouldin index for grouping imdb movies. J. Appl. Inform. Comput. 6(1), 07\u201315 (2022). https:\/\/doi.org\/10.30871\/jaic.v6i1.3485. https:\/\/jurnal.polibatam.ac.id\/index.php\/JAIC\/article\/view\/3485","DOI":"10.30871\/jaic.v6i1.3485"},{"key":"9_CR5","unstructured":"Balcan, M.F., Dick, T., Liang, Y., Mou, W., Zhang, H.: Differentially private clustering in high-dimensional Euclidean spaces. In: Precup, D., Teh, Y.W. (eds.) Proceedings of the 34th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a070, pp. 322\u2013331. PMLR (06\u201311 Aug 2017). https:\/\/proceedings.mlr.press\/v70\/balcan17a.html"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-319-78381-9_14","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"JH Cheon","year":"2018","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 360\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-319-70694-8_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"JH Cheon","year":"2017","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10624, pp. 409\u2013437. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70694-8_15"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Est\u00e9vez, P.A., Figueroa, C.J.: Online data visualization using the neural gas network. Neural Netw. 19(6), 923\u2013934 (2006). https:\/\/doi.org\/10.1016\/j.neunet.2006.05.024. advances in Self Organising Maps - WSOM\u201905","DOI":"10.1016\/j.neunet.2006.05.024"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Fr\u00e4nti, P., Sieranoja, S.: K-means properties on six clustering benchmark datasets. Appl. Intell. 48(12), 4743\u20134759 (2018). https:\/\/doi.org\/10.1007\/s10489-018-1238-7","DOI":"10.1007\/s10489-018-1238-7"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Gal\u00e1ntai, A.: The theory of newton\u2019s method. Journal of Computational and Applied Mathematics 124(1), 25\u201344 (2000). https:\/\/doi.org\/10.1016\/S0377-0427(00)00435-0. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377042700004350, numerical Analysis 2000. Vol. IV: Optimization and Nonlinear Equations","DOI":"10.1016\/S0377-0427(00)00435-0"},{"key":"9_CR11","doi-asserted-by":"publisher","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 (2016). https:\/\/doi.org\/10.1109\/TrustCom.2016.0140","DOI":"10.1109\/TrustCom.2016.0140"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Huang, Z., Liu, J.: Optimal differentially private algorithms for k-means clustering. In: Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS 2018, pp. 395\u2013408. Association for Computing Machinery, New York (2018). https:\/\/doi.org\/10.1145\/3196959.3196977, https:\/\/doi.org\/10.1145\/3196959.3196977","DOI":"10.1145\/3196959.3196977"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-030-10970-7_21","volume-title":"Selected Areas in Cryptography - SAC 2018","author":"A J\u00e4schke","year":"2018","unstructured":"J\u00e4schke, A., Armknecht, F.: Unsupervised machine learning on encrypted data. In: Cid, C., Jacobson, M.J., Jr. (eds.) Selected Areas in Cryptography - SAC 2018, pp. 453\u2013478. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_21"},{"key":"9_CR14","unstructured":"Krizhevsky, A.: Learning multiple layers of features from tiny images. Tech. rep. (2009)"},{"key":"9_CR15","unstructured":"LeCun, Y., Cortes, C., Burges, C.: Mnist handwritten digit database. ATT Labs [Online]. (2010). http:\/\/yann.lecun.com\/exdb\/mnist2"},{"key":"9_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-77870-5_23","author":"B Li","year":"2021","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. Springer-Verlag (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23","journal-title":"Springer-Verlag"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artint.2018.12.007","volume":"273","author":"F Li","year":"2019","unstructured":"Li, F., Qian, Y., Wang, J., Dang, C., Jing, L.: Clustering ensemble based on sample\u2019s stability. Artif. Intell. 273, 37\u201355 (2019). https:\/\/doi.org\/10.1016\/j.artint.2018.12.007","journal-title":"Artif. Intell."},{"key":"9_CR18","doi-asserted-by":"publisher","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. ASIA CCS \u201914, Association for Computing Machinery, New York (2014). https:\/\/doi.org\/10.1145\/2590296.2590332. https:\/\/doi.org\/10.1145\/2590296.2590332","DOI":"10.1145\/2590296.2590332"},{"issue":"2","key":"9_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982). https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.jbi.2018.07.004","volume":"85","author":"C Lopez","year":"2018","unstructured":"Lopez, C., Tucker, S., Salameh, T., Tucker, C.: An unsupervised machine learning method for discovering patient clusters based on genetic signatures. J. Biomed. Inform. 85, 30\u201339 (2018). https:\/\/doi.org\/10.1016\/j.jbi.2018.07.004","journal-title":"J. Biomed. Inform."},{"key":"9_CR21","unstructured":"MacQueen, J.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297. University of California Press (1967)"},{"key":"9_CR22","unstructured":"Matsuoka, K., Banno, R., Matsumoto, N., Sato, T., Bian, S.: Virtual secure platform: A $$\\{$$Five-Stage$$\\}$$ pipeline processor over $$\\{$$TFHE$$\\}$$. In: 30th USENIX security symposium (USENIX Security 21), pp. 4007\u20134024 (2021)"},{"key":"9_CR23","doi-asserted-by":"publisher","unstructured":"Minh, H.L., Sang-To, T., Abdel Wahab, M., Cuong-Le, T.: A new metaheuristic optimization based on k-means clustering algorithm and its application to structural damage identification. Knowl.-Based Syst. 251, 109189 (2022). https:\/\/doi.org\/10.1016\/j.knosys.2022.109189. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0950705122005913","DOI":"10.1016\/j.knosys.2022.109189"},{"key":"9_CR24","unstructured":"Mohassel, P., Rosulek, M., Trieu, N.: Practical privacy-preserving k-means clustering. Cryptology ePrint Archive, Paper 2019\/1158 (2019), https:\/\/eprint.iacr.org\/2019\/1158. https:\/\/eprint.iacr.org\/2019\/1158"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"More, J.J., Sorensen, D.C.: Newton\u2019s method (2 1982). https:\/\/doi.org\/10.2172\/5326201. https:\/\/www.osti.gov\/biblio\/5326201","DOI":"10.2172\/5326201"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"21053","DOI":"10.1109\/ACCESS.2018.2824798","volume":"6","author":"L Ni","year":"2018","unstructured":"Ni, L., Li, C., Wang, X., Jiang, H., Yu, J.: Dp-mcdbscan: differential privacy preserving multi-core dbscan clustering for network user data. IEEE Access 6, 21053\u201321063 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2824798","journal-title":"IEEE Access"},{"key":"9_CR27","doi-asserted-by":"publisher","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 (2015). https:\/\/doi.org\/10.1109\/CIC.2015.20","DOI":"10.1109\/CIC.2015.20"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Rodriguez, M.Z., Comin, C.H., Casanova, D., Bruno, O.M., Amancio, D.R., Costa, L.d.F., Rodrigues, F.A.: Clustering algorithms: A comparative approach. PLOS ONE 14(1), 1\u201334 (01 2019). https:\/\/doi.org\/10.1371\/journal.pone.0210236. https:\/\/doi.org\/10.1371\/journal.pone.0210236","DOI":"10.1371\/journal.pone.0210236"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"9589","DOI":"10.1109\/ACCESS.2016.2633544","volume":"4","author":"H Rong","year":"2016","unstructured":"Rong, H., Wang, H.M., Liu, J., Xian, M.: Privacy-preserving k-nearest neighbor computation in multiple cloud environments. IEEE Access 4, 9589\u20139603 (2016). https:\/\/doi.org\/10.1109\/ACCESS.2016.2633544","journal-title":"IEEE Access"},{"issue":"5","key":"9_CR30","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1109\/TKDE.2014.2364027","volume":"27","author":"BK Samanthula","year":"2015","unstructured":"Samanthula, B.K., Elmehdwi, Y., Jiang, W.: k-nearest neighbor classification over semantically secure encrypted relational data. IEEE Trans. Knowl. Data Eng. 27(5), 1261\u20131273 (2015). https:\/\/doi.org\/10.1109\/TKDE.2014.2364027","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Stemmer, U.: Locally private k-means clustering. In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, pp. 548\u2013559. Society for Industrial and Applied Mathematics, USA (2020)","DOI":"10.1137\/1.9781611975994.33"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Su, D., Cao, J., Li, N., Bertino, E., Jin, H.: Differentially private k-means clustering. In: Proceedings of the Sixth ACM Conference on Data and Application Security and Privacy, CODASPY 2016, pp. 26\u201337. Association for Computing Machinery, New York (2016). https:\/\/doi.org\/10.1145\/2857705.2857708. https:\/\/doi.org\/10.1145\/2857705.2857708","DOI":"10.1145\/2857705.2857708"},{"key":"9_CR33","unstructured":"Ultsch, A.: Clustering wih som: U* c. Proc. Workshop on Self-Organizing Maps (01 2005)"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Ultsch, A.: Emergence in self organizing feature maps. In: The 6th International Workshop on Self-Organizing Maps (WSOM 2007) (2007). https:\/\/doi.org\/10.2390\/biecoll-wsom2007-114. https:\/\/doi.org\/10.2390\/biecoll-wsom2007-114","DOI":"10.2390\/biecoll-wsom2007-114"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Wei, W., ming Tang, C., Chen, Y.: Efficient privacy-preserving k-means clustering from secret-sharing-based secure three-party computation. Entropy 24 (2022)","DOI":"10.3390\/e24081145"},{"key":"9_CR36","doi-asserted-by":"publisher","first-page":"41771","DOI":"10.1109\/ACCESS.2018.2859758","volume":"6","author":"W Wu","year":"2018","unstructured":"Wu, W., Liu, J., Rong, H., Wang, H., Xian, M.: Efficient k-nearest neighbor classification over semantically secure hybrid encrypted cloud database. IEEE Access 6, 41771\u201341784 (2018). https:\/\/doi.org\/10.1109\/ACCESS.2018.2859758","journal-title":"IEEE Access"},{"issue":"10","key":"9_CR37","doi-asserted-by":"publisher","first-page":"3424","DOI":"10.1109\/TKDE.2020.2969633","volume":"33","author":"W Wu","year":"2021","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 (2021). https:\/\/doi.org\/10.1109\/TKDE.2020.2969633","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-54770-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,5]],"date-time":"2024-03-05T16:13:44Z","timestamp":1709655224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-54770-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031547690","9783031547706"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-54770-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"1 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ACNS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Applied Cryptography and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Abu Dhabi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 March 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"acns2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wp.nyu.edu\/acns2024\/","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":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"230","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":"54","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":"0","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":"23% - 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":"4","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":"4-6","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)"}}]}}