Skip to main content

Toward Secure K-means Clustering Based on Homomorphic Encryption in Cloud

  • Conference paper
  • First Online:
Advances in Internet, Data & Web Technologies (EIDWT 2022)

Part of the book series: Lecture Notes on Data Engineering and Communications Technologies ((LNDECT,volume 118))

Abstract

In recent years, the cloud computation has provided great convenience for users to outsource data for storage and computation. But when data stored in cloud, it’s out of control from user, and there is a risk of private data leakage. In this paper, we propose a framework of secure K-means (CKKSKM) based on homomorphic encryption. The proposed scheme encrypts outsourcing data which can avoid to reveal the private information. We preprocess the data first and uses the Euclidean distance to calculate similarity, which can ensure the data accuracy and reduce the computing overhead. Based on CKKS homomorphic encryption, this scheme can solve the privacy security and reduce overhead of the user’s outsourcing data in cloud for storage and calculation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: ACM STOC, pp. 169–178 (2009)

    Google Scholar 

  2. Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 831–871 (2014)

    Google Scholar 

  3. Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: Takagi, T., Peyrin, T. (eds.) Advances in Cryptology. Lecture Notes in Computer Science, vol. 10624, pp. 409–437. Springer, Heidelberg (2017). https://doi.org/10.1007/978-3-319-70694-8_15

    Chapter  Google Scholar 

  4. Rao, F., 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–89 (2015)

    Google Scholar 

  5. Kim, H., Chang, J.W.: 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–931 (2018)

    Google Scholar 

  6. Wu, M., et al.: Robust global motion estimation for video security based on improved k-means clustering. J. Ambient. Intell. Humaniz. Comput. 10(2), 439–448 (2018). https://doi.org/10.1007/s12652-017-0660-8

    Article  Google Scholar 

  7. 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–285. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-64283-3_20

    Chapter  Google Scholar 

  8. Hong, Q., Hao, W., Xiaochao, W., Zhihua, Z.: Secure constant-round multi-user k-means clustering protocol. J. Comput. Res. Dev. 57, 2188–2200 (2020)

    Google Scholar 

  9. Vaidya, J., Clifton, C.: Privacy-preserving k-means clustering over vertically partitioned data. In: SIGKDD, pp. 206–215 (2003)

    Google Scholar 

  10. Kim, H.-J., Kim, H.-I., Chang, J.-W.: A privacy-preserving kNN classification algorithm using Yao's garbled circuit on cloud computing. In: 2017 IEEE 10th International Conference on Cloud Computing (CLOUD), pp. 766–769 (2017)

    Google Scholar 

  11. Zhang, J., Wu, G., Hu, X., Li, S., Hao, S.: A parallel K-means clustering algorithm with MPI. In: 2011 Fourth International Symposium on Parallel Architectures, Algorithms and Programming, pp. 60–64 (2011)

    Google Scholar 

  12. Chitrakar, A.S., Petrovic, S.: Analyzing digital evidence using parallel k-means with triangle inequality on spark. In: Proceedings of the IEEE Big Data 2nd International Workshop on Big Data Analytic for Cyber Crime Investigation and Prevention (2018)

    Google Scholar 

  13. Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining Knowl. Discov. 2, 283 (1998)

    Article  Google Scholar 

  14. Liu, J., Wang, C., Tu, Z., Wang, X.A., Lin, C., Li, Z.: Secure KNN classification scheme based on homomorphic encryption for cyberspace. Secur. Commun. Netw. 2021 Article ID 8759922 (2021)

    Google Scholar 

Download references

Acknowledgments

This work is supported by Natural Science Basic Research Plan in Shaanxi Province of China [No. 2018JM6028], the Foundation of Guizhou Provincial Key Laboratory of Public Big Data [No. 2019BDKFJJ008], Engineering University of PAP’s Funding for Scientific Research Innovation Team [No. KYTD201805] and Engineering University of PAP’s Funding for Key Researcher [No. KYGG202011].

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Tu, Z., Wang, X.A., Su, Y., Li, Y., Liu, J. (2022). Toward Secure K-means Clustering Based on Homomorphic Encryption in Cloud. In: Barolli, L., Kulla, E., Ikeda, M. (eds) Advances in Internet, Data & Web Technologies. EIDWT 2022. Lecture Notes on Data Engineering and Communications Technologies, vol 118. Springer, Cham. https://doi.org/10.1007/978-3-030-95903-6_7

Download citation

Publish with us

Policies and ethics