{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,23]],"date-time":"2026-02-23T14:24:30Z","timestamp":1771856670735,"version":"3.50.1"},"reference-count":30,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,12,20]],"date-time":"2022-12-20T00:00:00Z","timestamp":1671494400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602400"],"award-info":[{"award-number":["61602400"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007166","name":"Jiangsu Provincial Department of Education","doi-asserted-by":"publisher","award":["16KJB520043"],"award-info":[{"award-number":["16KJB520043"]}],"id":[{"id":"10.13039\/501100007166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["High-Confidence Computing"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1016\/j.hcc.2022.100100","type":"journal-article","created":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T20:16:17Z","timestamp":1671826577000},"page":"100100","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient secure and verifiable KNN set similarity search over outsourced clouds"],"prefix":"10.1016","volume":"3","author":[{"given":"Xufeng","family":"Jiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lu","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.hcc.2022.100100_b1","doi-asserted-by":"crossref","unstructured":"B. Yao, F. Li, X. Xiao, Secure nearest neighbor revisited, in: IEEE 29th International Conference on Data Engineering, ICDE, 2013, pp. 733\u2013744.","DOI":"10.1109\/ICDE.2013.6544870"},{"key":"10.1016\/j.hcc.2022.100100_b2","doi-asserted-by":"crossref","unstructured":"B. Wang, Y. Hou, M. Li, Practical and secure nearest neighbor search on encrypted large-scale data, in: 35th Annual IEEE International Conference on Computer Communications, 2016, pp. 1\u20139.","DOI":"10.1109\/INFOCOM.2016.7524389"},{"key":"10.1016\/j.hcc.2022.100100_b3","series-title":"ICDE","first-page":"664","article-title":"Secure k-nearest neighbor query over encrypted data in outsourced environments","author":"Elmehdwi","year":"2014"},{"key":"10.1016\/j.hcc.2022.100100_b4","doi-asserted-by":"crossref","DOI":"10.1016\/j.datak.2017.07.005","article-title":"A secure knn query processing algorithm using homomorphic encryption on outsourced database","volume":"123","author":"Kim","year":"2019","journal-title":"Data Knowl. Eng."},{"key":"10.1016\/j.hcc.2022.100100_b5","series-title":"ICDE","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.hcc.2022.100100_b6","series-title":"EDBT","first-page":"499","article-title":"Privacy preserving similarity evaluation of time series data","author":"Zhu","year":"2014"},{"key":"10.1016\/j.hcc.2022.100100_b7","series-title":"European Symposium on Research in Computer Security","first-page":"439","article-title":"Privacy-preserving collaborative medical time series analysis based on dynamic time warping","author":"Liu","year":"2019"},{"key":"10.1016\/j.hcc.2022.100100_b8","series-title":"ICDE","first-page":"66","article-title":"Efficient secure similarity computation on encrypted trajectory data","author":"Liu","year":"2015"},{"key":"10.1016\/j.hcc.2022.100100_b9","article-title":"Achieving efficient and privacy-preserving exact set similarity search over encrypted data","author":"Zheng","year":"2020","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.hcc.2022.100100_b10","article-title":"Efficient and privacy-preserving similarity range query over encrypted time series data","author":"Zheng","year":"2021","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"10.1016\/j.hcc.2022.100100_b11","series-title":"Database Systems for Advanced Applications","first-page":"559","article-title":"Fast multi-dimensional range queries on encrypted cloud databases","author":"Chi","year":"2017"},{"key":"10.1016\/j.hcc.2022.100100_b12","series-title":"ICDE","first-page":"626","article-title":"Servedb: Secure, verifiable, and efficient range queries on outsourced database","author":"Wu","year":"2019"},{"key":"10.1016\/j.hcc.2022.100100_b13","doi-asserted-by":"crossref","first-page":"2305","DOI":"10.1109\/TNET.2015.2457493","article-title":"Fast and scalable range query processing with strong privacy protection for cloud computing","volume":"24","author":"Li","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.hcc.2022.100100_b14","doi-asserted-by":"crossref","unstructured":"I. Demertzis, S. Papadopoulos, O. Papapetrou, A. Deligiannakis, M. Garofalakis, Practical private range search revisited, in: International Conference on Management of Data, 2016, pp. 185\u2013198.","DOI":"10.1145\/2882903.2882911"},{"key":"10.1016\/j.hcc.2022.100100_b15","series-title":"ICDE","first-page":"633","article-title":"Secure skyline queries on cloud platform","author":"Liu","year":"2017"},{"key":"10.1016\/j.hcc.2022.100100_b16","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1109\/TKDE.2018.2857471","article-title":"Secure and efficient skyline queries on encrypted data","volume":"31","author":"Liu","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.hcc.2022.100100_b17","series-title":"Web Information Systems Engineering","first-page":"83","article-title":"Efficient privacy-preserving skyline queries over outsourced cloud","author":"Li","year":"2020"},{"key":"10.1016\/j.hcc.2022.100100_b18","doi-asserted-by":"crossref","first-page":"4589","DOI":"10.1109\/TIFS.2021.3109459","article-title":"Efficient and privacy-preserving multi-party skyline queries over encrypted data","volume":"16","author":"Ding","year":"2021","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.hcc.2022.100100_b19","doi-asserted-by":"crossref","unstructured":"R.J. Bayardo, Y. Ma, R. Srikant, Scaling up all pairs similarity search, in: Proceedings of the 16th International Conference on World Wide Web, 2007, pp. 131\u2013140.","DOI":"10.1145\/1242572.1242591"},{"key":"10.1016\/j.hcc.2022.100100_b20","series-title":"ACM Transactions on Database Systems, Vol. 36","first-page":"1","article-title":"Efficient similarity joins for near-duplicate detection","author":"Xiao","year":"2011"},{"key":"10.1016\/j.hcc.2022.100100_b21","series-title":"ICDE","article-title":"A primitive operator for similarity joins in data cleaning","author":"Chaudhuri","year":"2006"},{"key":"10.1016\/j.hcc.2022.100100_b22","doi-asserted-by":"crossref","unstructured":"A.C.-C. Yao, How to generate and exchange secrets, in: Annual Symposium on Foundations of Computer Science, 1986, pp. 162\u2013167.","DOI":"10.1109\/SFCS.1986.25"},{"key":"10.1016\/j.hcc.2022.100100_b23","series-title":"Foundations of Cryptography: Volume 2, Basic Applications","author":"Goldreich","year":"2009"},{"key":"10.1016\/j.hcc.2022.100100_b24","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1109\/TKDE.2018.2886189","article-title":"A transformation-based framework for knn set similarity search","volume":"32","author":"Zhang","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.hcc.2022.100100_b25","series-title":"Annual International Cryptology Conference","first-page":"145","article-title":"Extending oblivious transfers efficiently","author":"Ishai","year":"2003"},{"key":"10.1016\/j.hcc.2022.100100_b26","doi-asserted-by":"crossref","unstructured":"Y. Huang, D. Evans, J. Katz, L. Malka, Faster secure two-party computation using garbled circuits, in: 20th USENIX Security Symposium, USENIX Security, 2011.","DOI":"10.1007\/978-3-642-25560-1_2"},{"key":"10.1016\/j.hcc.2022.100100_b27","series-title":"Cryptology and Network Security","first-page":"1","article-title":"Improved garbled circuit building blocks and applications to auctions and computing minima","author":"Kolesnikov","year":"2009"},{"key":"10.1016\/j.hcc.2022.100100_b28","doi-asserted-by":"crossref","unstructured":"K.E. Batcher, Sorting networks and their applications, in: Proceedings of the Spring Joint Computer Conference, 1968, pp. 307\u2013314.","DOI":"10.1145\/1468075.1468121"},{"key":"10.1016\/j.hcc.2022.100100_b29","series-title":"International Colloquium on Automata, Languages, and Programming","first-page":"486","article-title":"Improved garbled circuit: Free xor gates and applications","author":"Kolesnikov","year":"2008"},{"key":"10.1016\/j.hcc.2022.100100_b30","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s00145-008-9036-8","article-title":"A proof of security of Yao\u2019s protocol for two-party computation","author":"Lindell","year":"2009","journal-title":"J. Cryptol."}],"container-title":["High-Confidence Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295222000526?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2667295222000526?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T08:40:03Z","timestamp":1757407203000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2667295222000526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["S2667295222000526"],"URL":"https:\/\/doi.org\/10.1016\/j.hcc.2022.100100","relation":{},"ISSN":["2667-2952"],"issn-type":[{"value":"2667-2952","type":"print"}],"subject":[],"published":{"date-parts":[[2023,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient secure and verifiable KNN set similarity search over outsourced clouds","name":"articletitle","label":"Article Title"},{"value":"High-Confidence Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.hcc.2022.100100","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 The Author(s). Published by Elsevier B.V. on behalf of Shandong University.","name":"copyright","label":"Copyright"}],"article-number":"100100"}}