Skip to main content

2018 | OriginalPaper | Buchkapitel

Efficient Two-Party Privacy Preserving Collaborative k-means Clustering Protocol Supporting both Storage and Computation Outsourcing

verfasst von : Zoe L. Jiang, Ning Guo, Yabin Jin, Jiazhuo Lv, Yulin Wu, Yating Yu, Xuan Wang, S. M. Yiu, Junbin Fang

Erschienen in: Algorithms and Architectures for Parallel Processing

Verlag: Springer International Publishing

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Privacy preserving collaborative data mining aims to extract useful knowledge from distributed databases owned by multiple parties while keeping the privacy of both data and mining result. Nowadays, more and more companies reply on cloud to store data and handle with data. In this context, privacy preserving collaborative k-means clustering framework was proposed to support both storage and computation outsourcing for two parties. However, the computing cost and communication overhead are too high to practical. In this paper, we propose to encrypt each party’s data once and then store them in cloud. Privacy preserving k-means collaborative clustering protocol is executed mainly at cloud side, with total \(O(k(m+n))\)-round interactions among the two parties and the cloud. Here, m and n means that the total numbers of records for the two parties, respectively. The protocol is secure in the semi-honest security model and especially secure in the malicious model supporting only one party corrupted during k centroids re-computation. We also implement it in real cloud environment using e-health data as the testing data.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
2.
Zurück zum Zitat Agrawal, R., Srikant, R.: Privacy preserving data mining. ACM Sigmod 29(2), 439–450 (2000)CrossRef Agrawal, R., Srikant, R.: Privacy preserving data mining. ACM Sigmod 29(2), 439–450 (2000)CrossRef
3.
Zurück zum Zitat Vaidya, J., Clifton, C.: Privacy-preserving K-means clustering over vertically partitioned data. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206–215. ACM (2003) Vaidya, J., Clifton, C.: Privacy-preserving K-means clustering over vertically partitioned data. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 206–215. ACM (2003)
5.
Zurück zum Zitat Doganay, M.C., Pedersen, T.B., Saygin, Y., et al.: Distributed privacy preserving k-means clustering with additive secret sharing. In: International workshop on Privacy and Anonymity in Information Society 2008, pp. 3–11. ACM (2008) Doganay, M.C., Pedersen, T.B., Saygin, Y., et al.: Distributed privacy preserving k-means clustering with additive secret sharing. In: International workshop on Privacy and Anonymity in Information Society 2008, pp. 3–11. ACM (2008)
7.
Zurück zum Zitat Patel, S., Garasia, S., Jinwala, D.: An efficient approach for privacy preserving distributed K-means clustering based on Shamir’s secret sharing scheme. In: Dimitrakos, T., Moona, R., Patel, D., McKnight, D.H. (eds.) IFIPTM 2012. IAICT, vol. 374, pp. 129–141. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-29852-3_9CrossRef Patel, S., Garasia, S., Jinwala, D.: An efficient approach for privacy preserving distributed K-means clustering based on Shamir’s secret sharing scheme. In: Dimitrakos, T., Moona, R., Patel, D., McKnight, D.H. (eds.) IFIPTM 2012. IAICT, vol. 374, pp. 129–141. Springer, Heidelberg (2012). https://​doi.​org/​10.​1007/​978-3-642-29852-3_​9CrossRef
9.
Zurück zum Zitat Liu, D., Bertino, E., Yi, X.: Privacy of outsourced k-means clustering. In: ACM Symposium on Information, Computer and Communications Security 2014, pp. 123–134. ACM (2014) Liu, D., Bertino, E., Yi, X.: Privacy of outsourced k-means clustering. In: ACM Symposium on Information, Computer and Communications Security 2014, pp. 123–134. ACM (2014)
10.
Zurück zum Zitat Patel, S., Sonar, M., Jinwala, D.C.: Privacy preserving distributed K-means clustering in Malicious model using verifiable secret sharing scheme. Int. J. Distrib. Syst. Technol. (IJDST) 5(2), 44–70 (2014)CrossRef Patel, S., Sonar, M., Jinwala, D.C.: Privacy preserving distributed K-means clustering in Malicious model using verifiable secret sharing scheme. Int. J. Distrib. Syst. Technol. (IJDST) 5(2), 44–70 (2014)CrossRef
11.
Zurück zum Zitat Liu, X., Jiang, Z.L., Yiu, S.M., 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) 2015, pp. 124–133. IEEE (2015) Liu, X., Jiang, Z.L., Yiu, S.M., 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) 2015, pp. 124–133. IEEE (2015)
12.
Zurück zum Zitat Samanthula, B.K., Rao, F.Y., Bertino, E., et al.: Privacy-preserving and outsourced multi-user k-means clustering. In: IEEE Conference on Collaboration and Internet Computing 2015, pp. 80–90. IEEE (2015) Samanthula, B.K., Rao, F.Y., Bertino, E., et al.: Privacy-preserving and outsourced multi-user k-means clustering. In: IEEE Conference on Collaboration and Internet Computing 2015, pp. 80–90. IEEE (2015)
14.
Zurück zum Zitat Xu, L., Jiang, C., Wang, J., et al.: Information security in big data: privacy and data mining. IEEE Access 2014(2), 1–28 (2014) Xu, L., Jiang, C., Wang, J., et al.: Information security in big data: privacy and data mining. IEEE Access 2014(2), 1–28 (2014)
15.
Zurück zum Zitat Mohassel, P., Rosulek, M., Zhang, Y.: Fast and secure three-party computation: the garbled circuit approach. In: ACM SIGSAC Conference on Computer and Communications Security, pp. 591–602. ACM (2015) Mohassel, P., Rosulek, M., Zhang, Y.: Fast and secure three-party computation: the garbled circuit approach. In: ACM SIGSAC Conference on Computer and Communications Security, pp. 591–602. ACM (2015)
16.
Zurück zum Zitat Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: ACM Conference on Computer and Communications Security 2012, pp. 784–796. ACM (2012) Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: ACM Conference on Computer and Communications Security 2012, pp. 784–796. ACM (2012)
17.
Zurück zum Zitat López-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: ACM Symposium on Theory of Computing 2012, pp. 1219–1234. ACM (2012) López-Alt, A., Tromer, E., Vaikuntanathan, V.: On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption. In: ACM Symposium on Theory of Computing 2012, pp. 1219–1234. ACM (2012)
18.
Zurück zum Zitat Li, P., Li, J., Huang, Z., et al.: Privacy-preserving outsourced classification in cloud computing. Cluster Comput. 1–10 (2017) Li, P., Li, J., Huang, Z., et al.: Privacy-preserving outsourced classification in cloud computing. Cluster Comput. 1–10 (2017)
19.
Zurück zum Zitat Li, P., Li, J., Huang, Z., et al.: Multi-key privacy-preserving deep learning in cloud computing. Future Gener. Comput. Syst. 74, 76–85 (2017)CrossRef Li, P., Li, J., Huang, Z., et al.: Multi-key privacy-preserving deep learning in cloud computing. Future Gener. Comput. Syst. 74, 76–85 (2017)CrossRef
20.
Zurück zum Zitat Liu, X., Choo, R., Deng, R., et al.: Efficient and privacy-preserving outsourced calculation of rational numbers. IEEE Trans. Dependable Secure Comput. 15, 27–39 (2016)CrossRef Liu, X., Choo, R., Deng, R., et al.: Efficient and privacy-preserving outsourced calculation of rational numbers. IEEE Trans. Dependable Secure Comput. 15, 27–39 (2016)CrossRef
21.
Zurück zum Zitat Liu, X., Deng, R.H., Choo, K.K.R., et al.: An efficient privacy-preserving outsourced calculation toolkit with multiple keys. IEEE Trans. Inf. Forensics Secur. 11(11), 2401 (2016)CrossRef Liu, X., Deng, R.H., Choo, K.K.R., et al.: An efficient privacy-preserving outsourced calculation toolkit with multiple keys. IEEE Trans. Inf. Forensics Secur. 11(11), 2401 (2016)CrossRef
22.
Zurück zum Zitat Liu, X., Deng, R.H., Ding, W., et al.: Privacy-preserving outsourced calculation on floating point numbers. IEEE Trans. Inf. Forensics Secur. 11(11), 2513–2527 (2016)CrossRef Liu, X., Deng, R.H., Ding, W., et al.: Privacy-preserving outsourced calculation on floating point numbers. IEEE Trans. Inf. Forensics Secur. 11(11), 2513–2527 (2016)CrossRef
23.
Zurück zum Zitat Jagannathan, G., Wright, R.N.: Privacy-preserving distributed K-means clustering over arbitrarily partitioned data. In: ACM SIGKDD International Conference on Knowledge Discovery in Data Mining 2005, pp. 593–599. ACM (2005) Jagannathan, G., Wright, R.N.: Privacy-preserving distributed K-means clustering over arbitrarily partitioned data. In: ACM SIGKDD International Conference on Knowledge Discovery in Data Mining 2005, pp. 593–599. ACM (2005)
Metadaten
Titel
Efficient Two-Party Privacy Preserving Collaborative k-means Clustering Protocol Supporting both Storage and Computation Outsourcing
verfasst von
Zoe L. Jiang
Ning Guo
Yabin Jin
Jiazhuo Lv
Yulin Wu
Yating Yu
Xuan Wang
S. M. Yiu
Junbin Fang
Copyright-Jahr
2018
DOI
https://doi.org/10.1007/978-3-030-05063-4_34

Premium Partner