{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T07:49:20Z","timestamp":1782978560514,"version":"3.54.5"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031944444","type":"print"},{"value":"9783031944451","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T00:00:00Z","timestamp":1757030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T00:00:00Z","timestamp":1757030400000},"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":[[2026]]},"DOI":"10.1007\/978-3-031-94445-1_5","type":"book-chapter","created":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T17:14:18Z","timestamp":1757006058000},"page":"76-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Optimized Privacy-Preserving Clustering with\u00a0Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Chen","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jingwei","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenyuan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yong","family":"Feng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,9,5]]},"reference":[{"key":"5_CR1","unstructured":"Lattigo v5, February 2024. EPFL-LDS, Tune Insight SA. https:\/\/github.com\/tuneinsight\/lattigo"},{"issue":"3","key":"5_CR2","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1515\/jmc-2015-0016","volume":"9","author":"MR Albrecht","year":"2015","unstructured":"Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169\u2013203 (2015). https:\/\/doi.org\/10.1515\/jmc-2015-0016","journal-title":"J. Math. Cryptol."},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"Bossuat, J.P., Troncoso-Pastoriza, J., Hubaux, J.P.: Bootstrapping for approximate homomorphic encryption with negligible failure-probability by using sparse-secret encapsulation. In: Ateniese, G., Venturi, D. (eds.) ACNS 2022, LNCS, vol. 13269, pp. 521\u2013541. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-09234-3_26","DOI":"10.1007\/978-3-031-09234-3_26"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Brakerski, Z.: Fully homomorphic encryption without modulus switching from classical GapSVP. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 868\u2013886. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_50","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) 3rd ITCS, pp. 309\u2013325. ACM, New York (2012). https:\/\/doi.org\/10.1145\/2633600","DOI":"10.1145\/2633600"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Cheon, J.H., Han, K., Kim, A., Kim, M., Song, Y.: Bootstrapping for approximate homomorphic encryption. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology \u2013 EUROCRYPT 2018, pp. 360\u2013384. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_14","DOI":"10.1007\/978-3-319-78381-9_14"},{"key":"5_CR7","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-030-64834-3_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"JH Cheon","year":"2020","unstructured":"Cheon, J.H., Kim, D., Kim, D.: Efficient homomorphic comparison methods with optimal complexity. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020. LNCS, vol. 12492, pp. 221\u2013256. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64834-3_8"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2019","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2019). https:\/\/doi.org\/10.1007\/s00145-019-09319-x","journal-title":"J. Cryptol."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-662-46800-5_24","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2015","author":"L Ducas","year":"2015","unstructured":"Ducas, L., Micciancio, D.: FHEW: bootstrapping homomorphic encryption in less than a second. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9056, pp. 617\u2013640. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46800-5_24"},{"key":"5_CR11","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive (2012). https:\/\/eprint.iacr.org\/2012\/144"},{"issue":"12","key":"5_CR12","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). https:\/\/doi.org\/10.1007\/s10489-018-1238-7","journal-title":"Appl. Intell."},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, 31 May 31\u20132 June 2009, Bethesda, USA, pp. 169\u2013178. ACM, New York (2009). https:\/\/doi.org\/10.1145\/1536414.1536440","DOI":"10.1145\/1536414.1536440"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-642-40041-4_5","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"C Gentry","year":"2013","unstructured":"Gentry, C., Sahai, A., Waters, B.: Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 75\u201392. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_5"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"J\u00e4schke, A., Armknecht, F.: Unsupervised machine learning on encrypted data. In: Cid, C., Jacobson\u00a0Jr., M.J. (eds.) Selected Areas in Cryptography, SAC 2018. LNCS, vol. 11349, pp. 453\u2013478. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-10970-7_21","DOI":"10.1007\/978-3-030-10970-7_21"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Jha, S., Kruger, L., McDaniel, P.: Privacy preserving clustering. In: di\u00a0Vimercati, S.d.C., Syverson, P., Gollmann, D. (eds.) Computer Security, ESORICS 2005, vol.\u00a03679, pp. 397\u2013417. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_23","DOI":"10.1007\/11555827_23"},{"key":"5_CR17","unstructured":"Mohassel, P., Rosulek, M., Trieu, N.: Practical privacy-preserving k-means clustering (2019). https:\/\/eprint.iacr.org\/2019\/1158"},{"key":"5_CR18","unstructured":"LeCun, Y., Cortes, C., Burges, C.J.C.: The MNIST database of handwritten digits. http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Lee, JW., Lee, E., Lee, Y., Kim, YS., No, JS.: High-precision bootstrapping of RNS-CKKS homomorphic encryption using optimal minimax polynomial approximation and inverse sine function. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT 2021. LNCS, vol. 12696, pp. 618\u2013647. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_22","DOI":"10.1007\/978-3-030-77870-5_22"},{"key":"5_CR20","doi-asserted-by":"publisher","unstructured":"Lee, Y., Lee, J.W., Kim, Y.S., Kim, Y., No, J.S., Kang, H.: High-precision bootstrapping for approximate homomorphic encryption by error variance minimization. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, LNCS, vol. 13275, pp. 551\u2013580. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06944-4_19","DOI":"10.1007\/978-3-031-06944-4_19"},{"key":"5_CR21","doi-asserted-by":"publisher","unstructured":"Li, B., Micciancio, D.: On the security of homomorphic encryption on approximate numbers. In: Canteaut, A., Standaert, F.X. (eds.) EUROCRYPT 2021, LNCS, vol. 12696, pp. 648\u2013677. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77870-5_23","DOI":"10.1007\/978-3-030-77870-5_23"},{"key":"5_CR22","doi-asserted-by":"publisher","unstructured":"Lu, W., Huang, Z., Hong, C., Ma, Y., Qu, F.: PEGASUS: bridging polynomial and non-polynomial evaluations in homomorphic encryption. In: IEEE S &P 2021, pp. 1057\u20131073. IEEE Computer Society, Los Alamitos (2021). https:\/\/doi.org\/10.1109\/SP40001.2021.00043","DOI":"10.1109\/SP40001.2021.00043"},{"key":"5_CR23","doi-asserted-by":"publisher","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 43:1\u201343:35 (2013). https:\/\/doi.org\/10.1145\/2535925","DOI":"10.1145\/2535925"},{"key":"5_CR24","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: Proceedings of the 2015 IEEE Conference on Collaboration and Internet Computing, pp. 80\u201389. IEEE, Los Alamitos (2015). https:\/\/doi.org\/10.1109\/CIC.2015.20","DOI":"10.1109\/CIC.2015.20"},{"key":"5_CR25","doi-asserted-by":"publisher","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 34:1\u201334:40 (2009). https:\/\/doi.org\/10.1145\/1568318.1568324","DOI":"10.1145\/1568318.1568324"},{"key":"5_CR26","first-page":"165","volume-title":"Foundations of Secure Computation","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Adleman, L., Dertouzos, M.: On data banks and privacy homomorphisms. In: DeMillo, R.A., Dobkin, D.P., Jones, A.K., Lipton, R.J. (eds.) Foundations of Secure Computation, pp. 165\u2013179. Academic Press, Atlanta (1978)"},{"issue":"2","key":"5_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Sculley, D.: Web-scale k-means clustering. In: WWW \u201910, pp. 1177\u20131178. ACM, New York (2010). https:\/\/doi.org\/10.1145\/1772690.1772862","DOI":"10.1145\/1772690.1772862"},{"key":"5_CR29","unstructured":"Ultsch, A.: Clustering wih SOM: U*C. In: Proceedings of the Workshop on Self-Organizing Maps (2005)"},{"key":"5_CR30","doi-asserted-by":"publisher","unstructured":"Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: KDD \u201903, pp. 206\u2013215. ACM, New York, USA (2003). https:\/\/doi.org\/10.1145\/956750.956776","DOI":"10.1145\/956750.956776"},{"key":"5_CR31","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.jpdc.2021.03.009","volume":"154","author":"F Yongkai","year":"2021","unstructured":"Yongkai, F., et al.: PPMCK: privacy-preserving multi-party computing for k-means clustering. J. Parallel Distrib. Comput. 154, 54\u201363 (2021). https:\/\/doi.org\/10.1016\/j.jpdc.2021.03.009","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR32","doi-asserted-by":"publisher","unstructured":"Zhang, M., Wang, L., Zhang, X., Liu, Z., Wang, Y., Bao, H.: Efficient clustering on encrypted data. In: P\u00f6pper, C., Batina, L. (eds.) ACNS 2024, LNCS, vol. 14583, pp. 213\u2013236. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-54770-6_9","DOI":"10.1007\/978-3-031-54770-6_9"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Security and Privacy in Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-94445-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T06:16:36Z","timestamp":1764569796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-94445-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,5]]},"ISBN":["9783031944444","9783031944451"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-94445-1_5","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"value":"1867-8211","type":"print"},{"value":"1867-822X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,5]]},"assertion":[{"value":"5 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecureComm","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Security and Privacy in Communication Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","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":"28 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}