{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T10:53:20Z","timestamp":1775300000248,"version":"3.50.1"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030050627","type":"print"},{"value":"9783030050634","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-05063-4_34","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T19:23:45Z","timestamp":1544124225000},"page":"447-460","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Two-Party Privacy Preserving Collaborative k-means Clustering Protocol Supporting both Storage and Computation Outsourcing"],"prefix":"10.1007","author":[{"given":"Zoe L.","family":"Jiang","sequence":"first","affiliation":[]},{"given":"Ning","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Yabin","family":"Jin","sequence":"additional","affiliation":[]},{"given":"Jiazhuo","family":"Lv","sequence":"additional","affiliation":[]},{"given":"Yulin","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Yating","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Xuan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"S. M.","family":"Yiu","sequence":"additional","affiliation":[]},{"given":"Junbin","family":"Fang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"34_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-44598-6_3","volume-title":"Advances in Cryptology \u2014 CRYPTO 2000","author":"Y Lindell","year":"2000","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol. 1880, pp. 36\u201354. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44598-6_3"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1145\/335191.335438","volume":"29","author":"R Agrawal","year":"2000","unstructured":"Agrawal, R., Srikant, R.: Privacy preserving data mining. ACM Sigmod 29(2), 439\u2013450 (2000)","journal-title":"ACM Sigmod"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013215. ACM (2003)","DOI":"10.1145\/956750.956776"},{"key":"34_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11555827_23","volume-title":"Computer Security \u2013 ESORICS 2005","author":"S Jha","year":"2005","unstructured":"Jha, S., Kruger, L., McDaniel, P.: Privacy preserving clustering. In: di Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 397\u2013417. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11555827_23"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"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\u201311. ACM (2008)","DOI":"10.1145\/1379287.1379291"},{"key":"34_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-13601-6_17","volume-title":"Intelligence and Security Informatics","author":"M Upmanyu","year":"2010","unstructured":"Upmanyu, M., Namboodiri, A.M., Srinathan, K., Jawahar, C.V.: Efficient privacy preserving K-means clustering. In: Chen, H., Chau, M., Li, S., Urs, S., Srinivasa, S., Wang, G.A. (eds.) PAISI 2010. LNCS, vol. 6122, pp. 154\u2013166. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13601-6_17"},{"key":"34_CR7","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-29852-3_9","volume-title":"Trust Management VI","author":"S Patel","year":"2012","unstructured":"Patel, S., Garasia, S., Jinwala, D.: An efficient approach for privacy preserving distributed K-means clustering based on Shamir\u2019s secret sharing scheme. In: Dimitrakos, T., Moona, R., Patel, D., McKnight, D.H. (eds.) IFIPTM 2012. IAICT, vol. 374, pp. 129\u2013141. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29852-3_9"},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-36071-8_33","volume-title":"Distributed Computing and Internet Technology","author":"S Patel","year":"2013","unstructured":"Patel, S., Patel, V., Jinwala, D.: Privacy preserving distributed K-means clustering in Malicious model using zero knowledge proof. In: Hota, C., Srimani, P.K. (eds.) ICDCIT 2013. LNCS, vol. 7753, pp. 420\u2013431. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36071-8_33"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Liu, D., Bertino, E., Yi, X.: Privacy of outsourced k-means clustering. In: ACM Symposium on Information, Computer and Communications Security 2014, pp. 123\u2013134. ACM (2014)","DOI":"10.1145\/2590296.2590332"},{"issue":"2","key":"34_CR10","doi-asserted-by":"publisher","first-page":"44","DOI":"10.4018\/ijdst.2014040104","volume":"5","author":"S Patel","year":"2014","unstructured":"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\u201370 (2014)","journal-title":"Int. J. Distrib. Syst. Technol. (IJDST)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013133. IEEE (2015)","DOI":"10.1109\/MSN.2015.42"},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"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\u201390. IEEE (2015)","DOI":"10.1109\/CIC.2015.20"},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223\u2013238. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48910-X_16"},{"issue":"2","key":"34_CR14","first-page":"1","volume":"2014","author":"L Xu","year":"2014","unstructured":"Xu, L., Jiang, C., Wang, J., et al.: Information security in big data: privacy and data mining. IEEE Access 2014(2), 1\u201328 (2014)","journal-title":"IEEE Access"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013602. ACM (2015)","DOI":"10.1145\/2810103.2813705"},{"key":"34_CR16","doi-asserted-by":"crossref","unstructured":"Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: ACM Conference on Computer and Communications Security 2012, pp. 784\u2013796. ACM (2012)","DOI":"10.1145\/2382196.2382279"},{"key":"34_CR17","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-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\u20131234. ACM (2012)","DOI":"10.1145\/2213977.2214086"},{"key":"34_CR18","doi-asserted-by":"crossref","unstructured":"Li, P., Li, J., Huang, Z., et al.: Privacy-preserving outsourced classification in cloud computing. Cluster Comput. 1\u201310 (2017)","DOI":"10.1007\/s10586-017-0849-9"},{"key":"34_CR19","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.future.2017.02.006","volume":"74","author":"P Li","year":"2017","unstructured":"Li, P., Li, J., Huang, Z., et al.: Multi-key privacy-preserving deep learning in cloud computing. Future Gener. Comput. Syst. 74, 76\u201385 (2017)","journal-title":"Future Gener. Comput. Syst."},{"key":"34_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/TDSC.2016.2536601","volume":"15","author":"X Liu","year":"2016","unstructured":"Liu, X., Choo, R., Deng, R., et al.: Efficient and privacy-preserving outsourced calculation of rational numbers. IEEE Trans. Dependable Secure Comput. 15, 27\u201339 (2016)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"11","key":"34_CR21","doi-asserted-by":"publisher","first-page":"2401","DOI":"10.1109\/TIFS.2016.2573770","volume":"11","author":"X Liu","year":"2016","unstructured":"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)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"11","key":"34_CR22","doi-asserted-by":"publisher","first-page":"2513","DOI":"10.1109\/TIFS.2016.2585121","volume":"11","author":"X Liu","year":"2016","unstructured":"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\u20132527 (2016)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"34_CR23","doi-asserted-by":"crossref","unstructured":"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\u2013599. ACM (2005)","DOI":"10.1145\/1081870.1081942"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Architectures for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05063-4_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T09:55:25Z","timestamp":1775296525000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05063-4_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030050627","9783030050634"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05063-4_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"ICA3PP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithms and Architectures for Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ica3pp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/nsclab.org\/ica3pp2018\/authors.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"407","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"141","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"35% - 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"}},{"value":"2.3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"7.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}