{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:12:03Z","timestamp":1778271123121,"version":"3.51.4"},"reference-count":38,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Future Generation Computer Systems"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1016\/j.future.2024.107586","type":"journal-article","created":{"date-parts":[[2024,11,5]],"date-time":"2024-11-05T11:55:46Z","timestamp":1730807746000},"page":"107586","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Private approximate nearest neighbor search for on-chain data based on locality-sensitive hashing"],"prefix":"10.1016","volume":"164","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7584-7746","authenticated-orcid":false,"given":"Siyuan","family":"Shang","sequence":"first","affiliation":[]},{"given":"Xuehui","family":"Du","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0004-1561-8417","authenticated-orcid":false,"given":"Xiaohan","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9644-3812","authenticated-orcid":false,"given":"Aodi","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.future.2024.107586_b1","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1016\/j.future.2023.03.044","article-title":"A survey on the efficiency, reliability, and security of data query in blockchain systems","volume":"145","author":"Zhang","year":"2023","journal-title":"Future Gener. Comput. Syst."},{"issue":"4","key":"10.1016\/j.future.2024.107586_b2","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1109\/TEM.2019.2944279","article-title":"An efficient blockchain-based privacy-preserving collaborative filtering architecture","volume":"67","author":"Casino","year":"2020","journal-title":"IEEE Trans. Eng. Manage."},{"key":"10.1016\/j.future.2024.107586_b3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.future.2021.01.028","article-title":"Obpp: An ontology-based framework for privacy-preserving in IoT-based smart city","volume":"123","author":"Gheisari","year":"2021","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.future.2024.107586_b4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00453-003-1076-8","article-title":"A general model for authenticated data structures","volume":"39","author":"Martel","year":"2004","journal-title":"Algorithmica"},{"key":"10.1016\/j.future.2024.107586_b5","series-title":"2020 IEEE Symposium on Computers and Communications","first-page":"1","article-title":"Smart contract designs on blockchain applications","author":"Abuhashim","year":"2020"},{"key":"10.1016\/j.future.2024.107586_b6","series-title":"2021 3rd Novel Intelligent and Leading Emerging Sciences Conference","first-page":"365","article-title":"Efficient quering blockchain applications","author":"Thabet","year":"2021"},{"key":"10.1016\/j.future.2024.107586_b7","series-title":"International Conference on Database Systems for Advanced Applications","article-title":"EtherQL: A query layer for blockchain system","author":"Li","year":"2017"},{"key":"10.1016\/j.future.2024.107586_b8","doi-asserted-by":"crossref","DOI":"10.3390\/electronics12204317","article-title":"Design and implementation of enabling SQL\u2013query processing for ethereum-based blockchain systems","author":"Han","year":"2023","journal-title":"Electronics"},{"key":"10.1016\/j.future.2024.107586_b9","doi-asserted-by":"crossref","DOI":"10.55846\/9789675492860","article-title":"Learned-index-based semantic keyword query on blockchain","author":"Yao","year":"2023","journal-title":"Mathematics"},{"key":"10.1016\/j.future.2024.107586_b10","series-title":"2021 7th International Conference on Computer and Communications","first-page":"1539","article-title":"An efficient data query method of blockchain based on index","author":"Liu","year":"2021"},{"key":"10.1016\/j.future.2024.107586_b11","series-title":"2023 20th International Computer Conference on Wavelet Active Media Technology and Information Processing","first-page":"1","article-title":"Efficient and verifiable blockchain data query scheme based on external database","author":"Chunli","year":"2023"},{"issue":"8","key":"10.1016\/j.future.2024.107586_b12","doi-asserted-by":"crossref","first-page":"2209","DOI":"10.1109\/TC.2023.3241263","article-title":"Empowering authenticated and efficient queries for STK transaction-based blockchains","volume":"72","author":"Xu","year":"2023","journal-title":"IEEE Trans. Comput."},{"issue":"9","key":"10.1016\/j.future.2024.107586_b13","doi-asserted-by":"crossref","first-page":"9728","DOI":"10.1109\/TKDE.2023.3249279","article-title":"Enabling privacy-preserving and efficient authenticated graph queries on blockchain-assisted clouds","volume":"35","author":"Wu","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.future.2024.107586_b14","doi-asserted-by":"crossref","first-page":"3640","DOI":"10.1109\/TDSC.2021.3103382","article-title":"Toward a secure, rich, and fair query service for light clients on public blockchains","volume":"19","author":"Cai","year":"2022","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.future.2024.107586_b15","series-title":"VeriDB: An SGX-based verifiable database","author":"Zhou","year":"2021"},{"issue":"6","key":"10.1016\/j.future.2024.107586_b16","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/TPDS.2021.3113873","article-title":"VQL: Efficient and verifiable cloud query services for blockchain systems","volume":"33","author":"Wu","year":"2022","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"3","key":"10.1016\/j.future.2024.107586_b17","first-page":"2100","article-title":"Query integrity meets blockchain: A privacy-preserving verification framework for outsourced encrypted data","volume":"16","author":"Jiang","year":"2023","journal-title":"IEEE Trans. Serv. Comput."},{"key":"10.1016\/j.future.2024.107586_b18","series-title":"A privacy protection method of lightweight nodes in blockchain","first-page":"2067137:1","author":"Ge","year":"2021"},{"issue":"1","key":"10.1016\/j.future.2024.107586_b19","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1109\/JIOT.2022.3203182","article-title":"A flexible and efficient privacy-preserving range query scheme for blockchain-enhanced IoT","volume":"10","author":"Li","year":"2023","journal-title":"IEEE Internet Things J."},{"issue":"11","key":"10.1016\/j.future.2024.107586_b20","doi-asserted-by":"crossref","first-page":"7659","DOI":"10.1109\/TII.2020.3045038","article-title":"Blockchain empowered differentially private and auditable data publishing in industrial IoT","volume":"17","author":"Xu","year":"2021","journal-title":"IEEE Trans. Ind. Inform."},{"issue":"4","key":"10.1016\/j.future.2024.107586_b21","doi-asserted-by":"crossref","first-page":"824","DOI":"10.1109\/TPAMI.2018.2889473","article-title":"Efficient and robust approximate nearest neighbor search using hierarchical navigable small world graphs","volume":"42","author":"Malkov","year":"2020","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.future.2024.107586_b22","doi-asserted-by":"crossref","first-page":"461","DOI":"10.14778\/3303753.3303754","article-title":"Fast approximate nearest neighbor search with the navigating spreading-out graph","volume":"12","author":"Fu","year":"2017","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.future.2024.107586_b23","doi-asserted-by":"crossref","DOI":"10.1186\/s13638-018-1221-3","article-title":"Oprcp: approximate nearest neighbor binary search algorithm for hybrid data over WMSN blockchain","volume":"2018","author":"Liu","year":"2018","journal-title":"EURASIP J. Wireless Commun. Networking"},{"key":"10.1016\/j.future.2024.107586_b24","doi-asserted-by":"crossref","DOI":"10.1002\/qute.202300221","article-title":"Quantum K-nearest neighbor classification algorithm via a divide-and-conquer strategy","volume":"7","author":"Gong","year":"2024","journal-title":"Adv. Quantum Technol."},{"key":"10.1016\/j.future.2024.107586_b25","series-title":"Sanns: Scaling up secure approximate k -nearest neighbors search","author":"Chen","year":"2019"},{"key":"10.1016\/j.future.2024.107586_b26","unstructured":"K. Cong, R. Geelen, J. Kang, J. Park, Revisiting oblivious top-k selection with applications to secure k -NN classification. URL https:\/\/api.semanticscholar.org\/CorpusID:268634025."},{"key":"10.1016\/j.future.2024.107586_b27","series-title":"Threshold KNN-Shapley: A linear-time and privacy-friendly approach to data valuation","author":"Wang","year":"2023"},{"key":"10.1016\/j.future.2024.107586_b28","unstructured":"https:\/\/github.com\/shreyansh-jain-2201\/sector-knn-algorithm-for-lightweight-iot-devices."},{"key":"10.1016\/j.future.2024.107586_b29","series-title":"2022 IEEE Symposium on Security and Privacy","first-page":"911","article-title":"Private approximate nearest neighbor search with sublinear communication","author":"Servan-Schreiber","year":"2022"},{"key":"10.1016\/j.future.2024.107586_b30","series-title":"Function secret sharing: Improvements and extensions","author":"Boyle","year":"2016"},{"key":"10.1016\/j.future.2024.107586_b31","series-title":"Very Large Data Bases Conference","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"Lv","year":"2007"},{"key":"10.1016\/j.future.2024.107586_b32","doi-asserted-by":"crossref","first-page":"321","DOI":"10.4086\/toc.2012.v008a014","article-title":"Approximate nearest neighbor: Towards removing the curse of dimensionality","volume":"8","author":"Har-Peled","year":"2012","journal-title":"Theory Comput."},{"key":"10.1016\/j.future.2024.107586_b33","series-title":"2018 IEEE Symposium on Security and Privacy","first-page":"962","article-title":"PIR with compressed queries and amortized query processing","author":"Angel","year":"2018"},{"key":"10.1016\/j.future.2024.107586_b34","series-title":"Symposium on the Theory of Computing","article-title":"Completeness theorems for non-cryptographic fault-tolerant distributed computation","author":"Ben-Or","year":"1988"},{"issue":"6","key":"10.1016\/j.future.2024.107586_b35","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","article-title":"Private information retrieval","volume":"45","author":"Chor","year":"1998","journal-title":"J. ACM"},{"key":"10.1016\/j.future.2024.107586_b36","series-title":"2007 IEEE Symposium on Security and Privacy","first-page":"321","article-title":"Ciphertext-policy attribute-based encryption","author":"Bethencourt","year":"2007"},{"key":"10.1016\/j.future.2024.107586_b37","series-title":"Fame: Fast attribute-based message encryption","author":"Agrawal","year":"2017"},{"key":"10.1016\/j.future.2024.107586_b38","doi-asserted-by":"crossref","DOI":"10.1016\/j.is.2019.02.006","article-title":"Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms","volume":"87","author":"Aum\u00fcller","year":"2020","journal-title":"Inf. Syst."}],"container-title":["Future Generation Computer Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X24005508?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167739X24005508?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:14:56Z","timestamp":1778267696000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167739X24005508"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":38,"alternative-id":["S0167739X24005508"],"URL":"https:\/\/doi.org\/10.1016\/j.future.2024.107586","relation":{},"ISSN":["0167-739X"],"issn-type":[{"value":"0167-739X","type":"print"}],"subject":[],"published":{"date-parts":[[2025,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Private approximate nearest neighbor search for on-chain data based on locality-sensitive hashing","name":"articletitle","label":"Article Title"},{"value":"Future Generation Computer Systems","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.future.2024.107586","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2024 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":"107586"}}