{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:07:40Z","timestamp":1742936860526,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031649530"},{"type":"electronic","value":"9783031649547"}],"license":[{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T00:00:00Z","timestamp":1728950400000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-64954-7_14","type":"book-chapter","created":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T10:02:17Z","timestamp":1728900137000},"page":"266-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient and\u00a0Scalable Multi-party Privacy-Preserving k-NN Classification"],"prefix":"10.1007","author":[{"given":"Xinglei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haifeng","family":"Qian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,15]]},"reference":[{"key":"14_CR1","unstructured":"Andoni, A., Indyk, P., Laarhoven, T., Razenshteyn, I., Schmidt, L.: Practical and optimal lsh for angular distance. Advances in neural information processing systems 28 (2015)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM conference on Computer and communications security. pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.knosys.2017.12.018","volume":"144","author":"S Demir","year":"2018","unstructured":"Demir, S., Tugrul, B.: Privacy-preserving trend surface analysis on partitioned data. Knowl.-Based Syst. 144, 16\u201320 (2018)","journal-title":"Knowl.-Based Syst."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Dijk, M.v., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Annual international conference on the theory and applications of cryptographic techniques. pp. 24\u201343. Springer (2010)","DOI":"10.1007\/978-3-642-13190-5_2"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Du, J., Bian, F.: A privacy-preserving and efficient k-nearest neighbor query and classification scheme based on k-dimensional tree for outsourced data. IEEE Access (2020)","DOI":"10.1109\/ACCESS.2020.2986245"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Elmehdwi, Y., Samanthula, B.K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. international conference on data engineering (2013)","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Guan, Y., Lu, R., Zheng, Y., Zhang, S., Shao, J., Wei, G.: Toward privacy-preserving cybertwin-based spatiotemporal keyword query for its in 6g era. IEEE internet of things journal (8-22) (2021)","DOI":"10.1109\/JIOT.2021.3096674"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1016\/j.datak.2007.03.015","volume":"63","author":"A Inan","year":"2007","unstructured":"Inan, A., Kaya, S.V., Sayg\u0131n, Y., Sava\u015f, E., Hinto\u011flu, A.A., Levi, A.: Privacy preserving clustering on horizontally partitioned data. Data & Knowledge Engineering 63(3), 646\u2013666 (2007)","journal-title":"Data & Knowledge Engineering"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1016\/j.apgeog.2015.12.006","volume":"67","author":"BA Johnson","year":"2016","unstructured":"Johnson, B.A., Iizuka, K.: Integrating openstreetmap crowdsourced data and landsat time-series imagery for rapid land use\/land cover (lulc) mapping: Case study of the laguna de bay area of the philippines. Appl. Geogr. 67, 140\u2013149 (2016)","journal-title":"Appl. Geogr."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Kantarc\u0131o\u01e7lu, M., Clifton, C.: Privately computing a distributed k-nn classifier. In: European conference on principles of data mining and knowledge discovery. pp. 279\u2013290. Springer (2004)","DOI":"10.1007\/978-3-540-30116-5_27"},{"key":"14_CR11","unstructured":"Kesarwani, M., Kaul, A., Naldurg, P., Patranabis, S., Singh, G., Mehta, S., Mukhopadhyay, D.: Efficient secure k-nearest neighbours over encrypted data. In: EDBT. vol.\u00a02018, pp. 564\u2013575 (2018)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Lei, X., Liu, A.X., Li, R.: Secure knn queries over encrypted data: Dimensionality is not always a curse. international conference on data engineering (2017)","DOI":"10.1109\/ICDE.2017.91"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Lindell, Y., Pinkas, B.: Privacy preserving data mining. In: Annual International Cryptology Conference. pp. 36\u201354. Springer (2000)","DOI":"10.1007\/3-540-44598-6_3"},{"issue":"6","key":"14_CR14","doi-asserted-by":"publisher","first-page":"5220","DOI":"10.1109\/JIOT.2020.2977253","volume":"7","author":"H Mahdikhani","year":"2020","unstructured":"Mahdikhani, H., Lu, R., Zheng, Y., Shao, J., Ghorbani, A.A.: Achieving o (log$$^3$$n) communication-efficient privacy-preserving range query in fog-based iot. IEEE Internet Things J. 7(6), 5220\u20135232 (2020)","journal-title":"IEEE Internet Things J."},{"key":"14_CR15","doi-asserted-by":"publisher","DOI":"10.7717\/peerj-cs.965","volume":"8","author":"M Osmanoglu","year":"2022","unstructured":"Osmanoglu, M., Demir, S., Tugrul, B.: Privacy-preserving k-nn interpolation over two encrypted databases. PeerJ Computer Science 8, e965 (2022)","journal-title":"PeerJ Computer Science"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"64617","DOI":"10.1109\/ACCESS.2020.2984579","volume":"8","author":"J Park","year":"2020","unstructured":"Park, J., Lee, D.H.: Parallelly running k-nearest neighbor classification over semantically secure encrypted data in outsourced environments. IEEE Access 8, 64617\u201364633 (2020)","journal-title":"IEEE Access"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Qi, Y., Atallah, M.J.: Efficient privacy-preserving k-nearest neighbor search. In: 2008 The 28th International Conference on Distributed Computing Systems. pp. 311\u2013319. IEEE (2008)","DOI":"10.1109\/ICDCS.2008.79"},{"key":"14_CR18","unstructured":"Ren, C.R., Hu, H., Xu, J., Choi, B.: Processing private queries over untrusted data cloud through privacy homomorphism. international conference on data engineering (2011)"},{"issue":"5","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1261","DOI":"10.1109\/TKDE.2014.2364027","volume":"27","author":"BK Samanthula","year":"2014","unstructured":"Samanthula, B.K., Elmehdwi, Y., Jiang, W.: K-nearest neighbor classification over semantically secure encrypted relational data. IEEE Trans. Knowl. Data Eng. 27(5), 1261\u20131273 (2014)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Shaneck, M., Kim, Y., Kumar, V.: Privacy preserving nearest neighbor search. In: Machine Learning in Cyber Trust, pp. 247\u2013276. Springer (2009)","DOI":"10.1007\/978-0-387-88735-7_10"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jpdc.2007.07.009","volume":"68","author":"DB Skillicorn","year":"2008","unstructured":"Skillicorn, D.B., McConnell, S.M.: Distributed prediction from vertically partitioned data. Journal of Parallel and Distributed computing 68(1), 16\u201336 (2008)","journal-title":"Journal of Parallel and Distributed computing"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Songhori, E.M., Hussain, S.U., Sadeghi, A.R., Koushanfar, F.: Compacting privacy-preserving k-nearest neighbor search using logic synthesis. In: 2015 52nd ACM\/EDAC\/IEEE Design Automation Conference (DAC). pp.\u00a01\u20136. IEEE (2015)","DOI":"10.1145\/2744769.2744808"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Wong, W.K., Cheung, D.W.l., Kao, B., Mamoulis, N.: Secure knn computation on encrypted databases. In: Proceedings of the 2009 ACM SIGMOD International Conference on Management of data. pp. 139\u2013152 (2009)","DOI":"10.1145\/1559845.1559862"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.comcom.2021.12.005","volume":"184","author":"B Xie","year":"2022","unstructured":"Xie, B., Xiang, T., Liao, X.: Access-oblivious and privacy-preserving k nearest neighbors classification in dual clouds. Comput. Commun. 184, 12\u201323 (2022)","journal-title":"Comput. Commun."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986). pp. 162\u2013167. IEEE (1986)","DOI":"10.1109\/SFCS.1986.25"},{"issue":"4","key":"14_CR26","doi-asserted-by":"publisher","first-page":"94","DOI":"10.3390\/fi11040094","volume":"11","author":"F Zantalis","year":"2019","unstructured":"Zantalis, F., Koulouras, G., Karabetsos, S., Kandris, D.: A review of machine learning and iot in smart transportation. Future Internet 11(4), 94 (2019)","journal-title":"Future Internet"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Zheng, Y., Lu, R., Guan, Y., Shao, J., Zhu, H.: Efficient and privacy-preserving similarity range query over encrypted time series data. IEEE Transactions on Dependable and Secure Computing (2021)","DOI":"10.1109\/TDSC.2021.3061611"},{"key":"14_CR28","unstructured":"Zhu, Y., Huang, Z., Takagi, T.: Secure and controllable k-nn query over encrypted cloud data with key confidentiality. Journal of Parallel and Distributed Computing (2016)"}],"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-64954-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T10:06:26Z","timestamp":1728900386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-64954-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,15]]},"ISBN":["9783031649530","9783031649547"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-64954-7_14","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024,10,15]]},"assertion":[{"value":"15 October 2024","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":"Hong Kong","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"securecomm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/securecomm.eai-conferences.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Confy +","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"180","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - 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 (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}