{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:32:36Z","timestamp":1760239956276,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032079008","type":"print"},{"value":"9783032079015","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T00:00:00Z","timestamp":1760227200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T00:00:00Z","timestamp":1760227200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-07901-5_4","type":"book-chapter","created":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:30:02Z","timestamp":1760185802000},"page":"63-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving k-Nearest Neighbor Query: Faster and\u00a0More Secure"],"prefix":"10.1007","author":[{"given":"Jialin","family":"Chi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cheng","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Axin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianqi","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ZheChen","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Min","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dengguo","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,12]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Wong, W. K., Cheung, D. W. L., Kao, B., et al.: Secure KNN computation on encrypted databases. In: SIGMOD, pp. 139\u2013152 (2009)","DOI":"10.1145\/1559845.1559862"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Hu, H., Xu, J., Ren, C., et al.: Processing private queries over untrusted data cloud through privacy homomorphism. In: ICDE, pp. 601\u2013612 (2011)","DOI":"10.1109\/ICDE.2011.5767862"},{"key":"4_CR3","unstructured":"Yao, B., Li, F., Xiao, X.: Secure nearest neighbor revisited. In: ICDE, pp. 733\u2013744 (2013)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Wang, B., Hou, Y., Li, M.: Practical and secure nearest neighbor search on encrypted large-scale data. In: INFOCOM, pp. 1\u20139 (2016)","DOI":"10.1109\/INFOCOM.2016.7524389"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Lei, X., Liu, A. X., Li, R., et al.: SecEQP: a secure and efficient scheme for SkNN query problem over encrypted geodata on cloud. In: ICDE, pp. 662\u2013673 (2019)","DOI":"10.1109\/ICDE.2019.00065"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Lei, X., Tu, G. H., Liu, A. X., et al.: Fast and secure KNN query processing in cloud computing. In: CNS, pp. 1\u20139 (2020)","DOI":"10.1109\/CNS48642.2020.9162307"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/TDSC.2020.2998039","volume":"19","author":"R Li","year":"2020","unstructured":"Li, R., Liu, A.X., Xu, H., et al.: Adaptive secure nearest neighbor query processing over encrypted data. IEEE Trans. Dependable Secure Comput. 19(1), 91\u2013106 (2020)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Asif, H., Vaidya, J., Shafiq, B., et al.: Secure and efficient k-NN queries. In: IFIPAICT, pp. 155\u2013170 (2017). https:\/\/doi.org\/10.1007\/978-3-319-58469-0_11","DOI":"10.1007\/978-3-319-58469-0_11"},{"key":"4_CR9","first-page":"1","volume":"123","author":"HI Kim","year":"2017","unstructured":"Kim, H.I., Kim, H.J., Chang, J.W.: A secure KNN query processing algorithm using homomorphic encryption on outsourced database. Data Knowl. Eng. 123, 1\u201320 (2017)","journal-title":"Data Knowl. Eng."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Li, Z., Tian, G., Tan, S.: Secure and efficient k-nearest neighbor query with privacy-preserving authentication. In: SocialSec, pp. 175\u2013198 (2022)","DOI":"10.1007\/978-981-19-7242-3_12"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Cui, N., Qian, K., Cai, T., et al.: Towards multi-user, secure, and verifiable kNN query in cloud database. IEEE Trans. Knowl. Data Eng. (2023)","DOI":"10.1109\/TKDE.2023.3237879"},{"issue":"18","key":"4_CR12","doi-asserted-by":"publisher","first-page":"21310","DOI":"10.1007\/s11227-023-05495-7","volume":"79","author":"T Ghunaim","year":"2023","unstructured":"Ghunaim, T., Kamel, I., Al Aghbari, Z.: Secure kNN query of outsourced spatial data using two-cloud architecture. J. Supercomput. 79(18), 21310\u201321345 (2023). https:\/\/doi.org\/10.1007\/s11227-023-05495-7","journal-title":"J. Supercomput."},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Elmehdwi, Y., Samanthula, B. K., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. In: ICDE, pp. 664\u2013675 (2014)","DOI":"10.1109\/ICDE.2014.6816690"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Cui, N., Yang, X., Wang, B., et al.: Svknn: efficient secure and verifiable k-nearest neighbor query on the cloud platform. In: ICDE, pp. 253\u2013264 (2020)","DOI":"10.1109\/ICDE48307.2020.00029"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Servan-Schreiber, S., Langowski, S., Devadas, S.: Private approximate nearest neighbor search with sublinear communication. In: S &P, pp. 911\u2013929 (2022)","DOI":"10.1109\/SP46214.2022.9833702"},{"key":"4_CR16","unstructured":"Chen, H., Chillotti, I., Dong, Y., et al.: SANNS: scaling up secure approximate k-nearest neighbors search. In: USENIX Security, pp. 2111\u20132128 (2020)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kellaris, G., Kollios, G., Nissim, K., et al.: Generic attacks on secure outsourced databases. In: CCS, pp. 1329\u20131340 (2016)","DOI":"10.1145\/2976749.2978386"},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Kornaropoulos, E. M., Papamanthou, C., Tamassia, R.: Data recovery on encrypted databases with k-nearest neighbor query leakage. In: S &P, pp. 1033\u20131050 (2019)","DOI":"10.1109\/SP.2019.00015"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Liu, J., Yang, J., Xiong, L., et al.: Secure skyline queries on cloud platform. In: ICDE, pp. 633\u2013644 (2017)","DOI":"10.1109\/ICDE.2017.117"},{"key":"4_CR20","unstructured":"Apostol, T.: Introduction to Analytic Number Theory. Springer, Heidelberg (2013)"},{"key":"4_CR21","first-page":"46","volume":"78","author":"F Mertens","year":"1874","unstructured":"Mertens, F.: Ein beitrag zur analytischen zahlentheorie. Journal f\u00fcr die reine und angewandte Mathematik 78, 46\u201362 (1874)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"199","DOI":"10.24033\/bsmf.545","volume":"24","author":"J Hadamard","year":"1896","unstructured":"Hadamard, J.: Sur la distribution des z\u00e9ros de la fonction $$\\zeta (s)$$ et ses cons\u00e9quences arithm\u00e9tiques. Bulletin de la Societ\u00e9 mathematique de France 24, 199\u2013220 (1896)","journal-title":"Bulletin de la Societ\u00e9 mathematique de France"},{"issue":"8","key":"4_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.3103\/S1066369X14080052","volume":"58","author":"ST Ishmukhametov","year":"2014","unstructured":"Ishmukhametov, S.T., Sharifullina, F.F.: On distribution of semiprime numbers. Russ. Math. 58(8), 43\u201348 (2014). https:\/\/doi.org\/10.3103\/S1066369X14080052","journal-title":"Russ. Math."},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Beaver, D.: Efficient multiparty protocols using circuit randomization. In: CRYPTO, pp. 420\u2013432 (1991). https:\/\/doi.org\/10.1007\/3-540-46766-1_34","DOI":"10.1007\/3-540-46766-1_34"},{"issue":"6","key":"4_CR25","doi-asserted-by":"publisher","first-page":"9841","DOI":"10.1109\/JIOT.2019.2932444","volume":"6","author":"L Liu","year":"2019","unstructured":"Liu, L., Su, J., Liu, X., et al.: Toward highly secure yet efficient KNN classification scheme on outsourced cloud data. IEEE Internet Things J. 6(6), 9841\u20139852 (2019)","journal-title":"IEEE Internet Things J."},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: PKC, pp. 343\u2013360 (2007)","DOI":"10.1007\/978-3-540-71677-8_23"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Schneider, T., Zohner, M.: GMW vs. Yao? Efficient secure two-party computation with low depth circuits. In: FC, pp. 275\u2013292 (2013)","DOI":"10.1007\/978-3-642-39884-1_23"},{"key":"4_CR28","doi-asserted-by":"crossref","unstructured":"Rathee, D., Schneider, T., Shukla, K. K.: Improved multiplication triple generation over rings via RLWE-based AHE. In: CANS, pp. 347\u2013359 (2019)","DOI":"10.1007\/978-3-030-31578-8_19"},{"key":"4_CR29","first-page":"4961","volume":"34","author":"B Knott","year":"2021","unstructured":"Knott, B., Venkataraman, S., Hannun, A., et al.: Crypten: secure multi-party computation meets machine learning. Adv. Neural. Inf. Process. Syst. 34, 4961\u20134973 (2021)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Cho, E., Myers, S. A., Leskovec, J.: Friendship and mobility: User movement in location-based social networks. In: KDD, pp. 1082\u20131090 (2011)","DOI":"10.1145\/2020408.2020579"},{"key":"4_CR31","unstructured":"NIST: Recommendation for key management. Special Publication 800-57 Part 1 Revision 5 (2020)"},{"key":"4_CR32","unstructured":"Goldreich, O.: Foundations of Cryptography: Volume 2, Basic Applications. Cambridge university press, vol. 2 (2009)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-07901-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:30:09Z","timestamp":1760185809000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-07901-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,12]]},"ISBN":["9783032079008","9783032079015"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-07901-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,12]]},"assertion":[{"value":"12 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.esorics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}