{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:22:59Z","timestamp":1780410179675,"version":"3.54.1"},"reference-count":34,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Shandong Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.future.2026.108566","type":"journal-article","created":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:23:36Z","timestamp":1777476216000},"page":"108566","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Towards post-quantum secure and practical privacy-preserving top-k maximum inner product search"],"prefix":"10.1016","volume":"183","author":[{"given":"Yuqi","family":"Song","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2474-910X","authenticated-orcid":false,"given":"Chengliang","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Delong","family":"Kong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guoyan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weizhong","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.future.2026.108566_b1","doi-asserted-by":"crossref","first-page":"61656","DOI":"10.1109\/ACCESS.2019.2916503","article-title":"A review of secure and privacy-preserving medical data sharing","volume":"7","author":"Jin","year":"2019","journal-title":"IEEE Access"},{"key":"10.1016\/j.future.2026.108566_b2","series-title":"Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security","isbn-type":"print","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/2897845.2897865","article-title":"Efficient multi-function data sharing and searching mechanism for cloud-based encrypted data","author":"Liang","year":"2016","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450342339"},{"key":"10.1016\/j.future.2026.108566_b3","series-title":"Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","isbn-type":"print","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1145\/2339530.2339677","article-title":"Maximum inner-product search using cone trees","author":"Ram","year":"2012","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450314626"},{"issue":"6","key":"10.1016\/j.future.2026.108566_b4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1007\/s10994-018-5711-7","article-title":"Improved maximum inner product search with better theoretical guarantee using randomized partition trees","volume":"107","author":"Keivani","year":"2018","journal-title":"Mach. Learn.","ISSN":"https:\/\/id.crossref.org\/issn\/0885-6125","issn-type":"print"},{"issue":"5","key":"10.1016\/j.future.2026.108566_b5","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.14778\/3579075.3579084","article-title":"FARGO: Fast maximum inner product search via global multi-probing","volume":"16","author":"Zhao","year":"2023","journal-title":"Proc. VLDB Endow.","ISSN":"https:\/\/id.crossref.org\/issn\/2150-8097","issn-type":"print"},{"key":"10.1016\/j.future.2026.108566_b6","first-page":"2321","article-title":"Asymmetric LSH (ALSH) for sublinear time maximum inner product search (MIPS)","volume":"vol. 2","author":"Shrivastava","year":"2014"},{"key":"10.1016\/j.future.2026.108566_b7","series-title":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining","isbn-type":"print","doi-asserted-by":"crossref","first-page":"1339","DOI":"10.1145\/3447548.3467345","article-title":"Simple yet efficient algorithms for maximum inner product search via extreme order statistics","author":"Pham","year":"2021","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450383325"},{"key":"10.1016\/j.future.2026.108566_b8","series-title":"Advances in Cryptology \u2013 CRYPTO 2011","isbn-type":"print","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-22792-9_7","article-title":"Verifiable delegation of computation over large datasets","author":"Benabbas","year":"2011","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642227929"},{"key":"10.1016\/j.future.2026.108566_b9","series-title":"Proceedings of the 2012 ACM Conference on Computer and Communications Security","isbn-type":"print","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/2382196.2382250","article-title":"Publicly verifiable delegation of large polynomials and matrix computations, with applications","author":"Fiore","year":"2012","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450316514"},{"key":"10.1016\/j.future.2026.108566_b10","series-title":"Computer Security \u2013 ESORICS 2023","first-page":"249","article-title":"Secure outsourced matrix multiplication with fully homomorphic encryption","author":"Zhu","year":"2024"},{"key":"10.1016\/j.future.2026.108566_b11","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.ins.2018.01.024","article-title":"Outsourcing scalar products and matrix products on privacy-protected unencrypted data stored in untrusted clouds","volume":"436\u2013437","author":"Domingo-Ferrer","year":"2018","journal-title":"Inform. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0020-0255","issn-type":"print"},{"issue":"5","key":"10.1016\/j.future.2026.108566_b12","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1109\/TSC.2016.2531665","article-title":"Publicly verifiable inner product evaluation over outsourced data streams under multiple keys","volume":"10","author":"Liu","year":"2017","journal-title":"IEEE Trans. Serv. Comput."},{"issue":"2","key":"10.1016\/j.future.2026.108566_b13","first-page":"1320","article-title":"Privacy-preserving outsourced inner product computation on encrypted database","volume":"19","author":"Yang","year":"2022","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"10.1016\/j.future.2026.108566_b14","series-title":"Proceedings of the 2009 ACM SIGMOD International Conference on Management of Data","isbn-type":"print","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1145\/1559845.1559862","article-title":"Secure kNN computation on encrypted databases","author":"Wong","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9781605585512"},{"key":"10.1016\/j.future.2026.108566_b15","series-title":"2013 Proceedings IEEE INFOCOM","first-page":"2652","article-title":"Efficient privacy-preserving biometric identification in cloud computing","author":"Yuan","year":"2013"},{"key":"10.1016\/j.future.2026.108566_b16","series-title":"2013 IEEE 29th International Conference on Data Engineering","first-page":"733","article-title":"Secure nearest neighbor revisited","author":"Yao","year":"2013"},{"key":"10.1016\/j.future.2026.108566_b17","series-title":"2017 IEEE 37th International Conference on Distributed Computing Systems","first-page":"1116","article-title":"Revisiting security risks of asymmetric scalar product preserving encryption and its variants","author":"Lin","year":"2017"},{"key":"10.1016\/j.future.2026.108566_b18","series-title":"2014 IEEE 30th International Conference on Data Engineering","first-page":"664","article-title":"Secure k-nearest neighbor query over encrypted data in outsourced environments","author":"Elmehdwi","year":"2014"},{"key":"10.1016\/j.future.2026.108566_b19","series-title":"2016 IEEE Trustcom\/BigDataSE\/ISPA","first-page":"236","article-title":"Efficient integrity verification of secure outsourced kNN computation in cloud environments","author":"Rong","year":"2016"},{"issue":"6","key":"10.1016\/j.future.2026.108566_b20","doi-asserted-by":"crossref","first-page":"5479","DOI":"10.1109\/TDSC.2024.3376084","article-title":"Achieving practical and privacy-preserving kNN query over encrypted data","volume":"21","author":"Zheng","year":"2024","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"10.1016\/j.future.2026.108566_b21","doi-asserted-by":"crossref","first-page":"2454","DOI":"10.1109\/TIFS.2024.3350909","article-title":"Secure and efficient similarity retrieval in cloud computing based on homomorphic encryption","volume":"19","author":"Wang","year":"2024","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"6","key":"10.1016\/j.future.2026.108566_b22","doi-asserted-by":"crossref","first-page":"10831","DOI":"10.1109\/JIOT.2023.3328709","article-title":"A privacy-aware K-nearest neighbor query scheme for location-based services","volume":"11","author":"Qi","year":"2024","journal-title":"IEEE Internet Things J."},{"issue":"3","key":"10.1016\/j.future.2026.108566_b23","doi-asserted-by":"crossref","first-page":"1434","DOI":"10.1109\/TBDATA.2024.3463543","article-title":"Verifiable and privacy-preserving kk-NN query scheme with multiple keys","volume":"11","author":"Zhang","year":"2025","journal-title":"IEEE Trans. Big Data"},{"key":"10.1016\/j.future.2026.108566_b24","series-title":"Proceedings of the 27th ACM International Conference on Information and Knowledge Management","isbn-type":"print","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/3269206.3271791","article-title":"Secure top-k inner product retrieval","author":"Zhang","year":"2018","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450360142"},{"key":"10.1016\/j.future.2026.108566_b25","series-title":"Advances in Cryptology \u2014 EUROCRYPT \u201999","isbn-type":"print","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","article-title":"Public-key cryptosystems based on composite degree residuosity classes","author":"Paillier","year":"1999","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540489108"},{"issue":"5","key":"10.1016\/j.future.2026.108566_b26","doi-asserted-by":"crossref","first-page":"2851","DOI":"10.1109\/TSC.2025.3600124","article-title":"EPPQ: Efficient and privacy-preserving knn query processing for outsourced high-dimensional data","volume":"18","author":"Wang","year":"2025","journal-title":"IEEE Trans. Serv. Comput."},{"key":"10.1016\/j.future.2026.108566_b27","series-title":"2025 IEEE 41st International Conference on Data Engineering","first-page":"3017","article-title":"Privacy-preserving approximate nearest neighbor search on high-dimensional data","author":"Liu","year":"2025"},{"issue":"18","key":"10.1016\/j.future.2026.108566_b28","doi-asserted-by":"crossref","first-page":"14219","DOI":"10.1109\/JIOT.2021.3068859","article-title":"Toward oblivious location-based k-nearest neighbor query in smart cities","volume":"8","author":"Guan","year":"2021","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.future.2026.108566_b29","series-title":"Proceedings - 2020 IEEE 36th International Conference on Data Engineering, ICDE 2020","first-page":"253","article-title":"SVkNN: Efficient secure and verifiable k-nearest neighbor query on the cloud platform","author":"Cui","year":"2020"},{"key":"10.1016\/j.future.2026.108566_b30","series-title":"Somewhat practical fully homomorphic encryption","author":"Fan","year":"2012"},{"key":"10.1016\/j.future.2026.108566_b31","series-title":"Advances in Cryptology \u2013 CRYPTO 2012","isbn-type":"print","doi-asserted-by":"crossref","first-page":"868","DOI":"10.1007\/978-3-642-32009-5_50","article-title":"Fully homomorphic encryption without modulus switching from classical gapsvp","author":"Brakerski","year":"2012","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642320095"},{"key":"10.1016\/j.future.2026.108566_b32","first-page":"201","article-title":"CryptoNets: applying neural networks to encrypted data with high throughput and accuracy","volume":"vol. 48","author":"Dowlin","year":"2016"},{"key":"10.1016\/j.future.2026.108566_b33","isbn-type":"print","article-title":"Introduction to modern cryptography","author":"Katz","year":"2020","ISBN":"https:\/\/id.crossref.org\/isbn\/9781351133029"},{"key":"10.1016\/j.future.2026.108566_b34","series-title":"Tenseal: A library for encrypted tensor operations using homomorphic encryption","author":"Benaissa","year":"2021"}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26002001?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X26002001?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T13:43:20Z","timestamp":1780407800000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X26002001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":34,"alternative-id":["S0167739X26002001"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2026.108566","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Towards post-quantum secure and practical privacy-preserving top- maximum inner product search","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2026.108566","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"108566"}}