Skip to main content

Privacy-Preserving Accelerated Clustering for Data Encrypted by Different Keys

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 12608))

Abstract

k-Means is a widely used clustering algorithm that divides data points into k groups. Previous studies focus on implementing secure k-Means clustering either for single user or for multiple users. The common way is to operate on outsourced and encrypted datasets in the cloud. Two difficulties exist in this procedure - how to handle with different keys and how to compute distance, comparison and division on the ciphertexts. On the other hand, k-Means algorithm includes many unnecessary distance calculations. In this paper, we aim to construct privacy-preserving protocol which accelerates k-Means algorithm for data encrypted by different keys in the cloud. Experiments show that our scheme is effective.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

References

  1. Ding, Y., Zhao, Y., Shen, X., Musuvathi, M., Mytkowicz, T.: Yinyang k-means: a drop-in replacement of the classic k-means with consistent speedup. In: International Conference on Machine Learning, pp. 579–587 (2015)

    Google Scholar 

  2. Drake, J., Hamerly, G.: Accelerated k-means with adaptive distance bounds. In: 5th NIPS Workshop on Optimization for Machine Learning, vol. 8 (2012)

    Google Scholar 

  3. Elkan, C.: Using the triangle inequality to accelerate k-means. In: International Conference on Machine Learning (ICML), pp. 147–153 (2003)

    Google Scholar 

  4. Hamerly, G.: Making k-means even faster. In: SIAM International Conference on Data Mining, pp. 130–140 (2010)

    Google Scholar 

  5. Liu, D., Bertino, E., Yi, X.: Privacy of outsourced k-means clustering. In: 9th ACM Symposium on Information, Computer and Communications Security, pp. 123–134 (2014)

    Google Scholar 

  6. Lloyd, S.: Least-Squares Quantization in PCM. IEEE Trans. Inf. Theor. 28(2), 129–137 (1982)

    Google Scholar 

  7. Rao, F.Y., Samanthula, B.K., Bertino, E., Yi, X., Liu, D.: Privacy-preserving and outsourced multi-user k-means clustering. In: IEEE Conference on Collaboration and Internet Computing (CIC), pp. 80–89 (2015)

    Google Scholar 

  8. Rong, H., Wang, H., Liu, J., Hao, J., Xian, M.: Privacy-preserving-means clustering under multiowner setting in distributed cloud environments. Secur. Commun. Networks 2017, (2017)

    Google Scholar 

  9. Sakellariou, G., Gounaris, A.: Homomorphically encrypted k-means on cloud-hosted servers with low client-side load. Computing 101(12), 1813–1836 (2019)

    Article  MathSciNet  Google Scholar 

  10. 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. (2020)

    Google Scholar 

  11. Yuan, J., Tian, Y.: Practical privacy-preserving mapreduce based k-means clustering over large-scale dataset. IEEE Trans. Cloud Comput. 7(2), 568-579 (2017)

    Google Scholar 

  12. Zhang, J., He, M., Zeng, G., Yiu, S.M.: Privacy-preserving verifiable elastic net among multiple institutions in the cloud. J. Comput. Secur. 26(6), 791–815 (2018)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jun Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, J., Wang, Y., Li, B., Hu, S. (2021). Privacy-Preserving Accelerated Clustering for Data Encrypted by Different Keys. In: Qiu, M. (eds) Smart Computing and Communication. SmartCom 2020. Lecture Notes in Computer Science(), vol 12608. Springer, Cham. https://doi.org/10.1007/978-3-030-74717-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-74717-6_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-74716-9

  • Online ISBN: 978-3-030-74717-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics