{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T00:12:28Z","timestamp":1760746348886,"version":"build-2065373602"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,9,1]],"date-time":"2025-09-01T00:00:00Z","timestamp":1756684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:00:00Z","timestamp":1757462400000},"content-version":"vor","delay-in-days":9,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"funder":[{"name":"Natural Science Foundation of Jilin Province,China","award":["20210101172JC"],"award-info":[{"award-number":["20210101172JC"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62076108"],"award-info":[{"award-number":["62076108"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s12083-025-02090-w","type":"journal-article","created":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T12:58:36Z","timestamp":1757509116000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards privacy-preserving multi-dimensional range query over attribute missing data"],"prefix":"10.1007","volume":"18","author":[{"given":"Hang","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lili","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yonggang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,9,10]]},"reference":[{"key":"2090_CR1","doi-asserted-by":"publisher","first-page":"6393","DOI":"10.1109\/JIOT.2020.3042174","volume":"8","author":"N Magaia","year":"2021","unstructured":"Magaia N, Fonseca R, Muhammad K, Segundo AHFN, Neto AVL, Albuquerque VHC (2021) Industrial internet-of-things security enhanced with deep learning approaches for smart cities. IEEE Internet Things J 8:6393\u20136405","journal-title":"IEEE Internet Things J"},{"key":"2090_CR2","doi-asserted-by":"crossref","unstructured":"Aldahmani A, Ouni B, Lestable T, Debbah M (2023) Cyber-security of embedded iots in smart homes: challenges, requirements, countermeasures, and trends. IEEE Open J Veh Technol 281\u2013292","DOI":"10.1109\/OJVT.2023.3234069"},{"key":"2090_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TTS.2022.3191515","volume":"3","author":"S Sodagari","year":"2022","unstructured":"Sodagari S (2022) Trends for mobile iot crowdsourcing privacy and security in the big data era. IEEE Trans Technol Soc 3:199\u2013225","journal-title":"IEEE Trans Technol Soc"},{"key":"2090_CR4","first-page":"1131","volume":"2016","author":"DS Roche","year":"2016","unstructured":"Roche DS, Apon D, Choi SG, Yerukhimovich A (2016) POPE: partial order preserving encoding. SIGSAC 2016:1131\u20131142","journal-title":"SIGSAC"},{"key":"2090_CR5","doi-asserted-by":"crossref","unstructured":"Zhan Y, Shen D, Duan P, Zhang B, Hong Z, Wang B (2022) MDOPE: efficient multi-dimensional data order preserving encryption scheme. Inf Sci 334\u2013343","DOI":"10.1016\/j.ins.2022.03.001"},{"key":"2090_CR6","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/TDSC.2014.2313863","volume":"3","author":"Y Lee","year":"2014","unstructured":"Lee Y (2014) Secure ordered bucketization. IEEE Trans Dependable Secur Comput 3:292\u2013303","journal-title":"IEEE Trans Dependable Secur Comput"},{"key":"2090_CR7","doi-asserted-by":"crossref","unstructured":"Hore B, Mehrotra S, Canim M, Kantarcioglu M (2012) Secure multidimensional range queries over outsourced data. VLDB J 333\u2013358","DOI":"10.1007\/s00778-011-0245-7"},{"key":"2090_CR8","doi-asserted-by":"crossref","unstructured":"Yang W, Liu L, Liu Y, Fan L, Lu W (2022) Secure and efficient multi-dimensional range query algorithm over tmwsns. Ad Hoc Netw 102820","DOI":"10.1016\/j.adhoc.2022.102820"},{"key":"2090_CR9","doi-asserted-by":"crossref","unstructured":"Mei Z, Yu J, Zhang C, Wu B, Yao S, Shi J, Wu Z (2024) Secure multi-dimensional data retrieval with access control and range query in the cloud. Inf Syst 102343","DOI":"10.1016\/j.is.2024.102343"},{"key":"2090_CR10","doi-asserted-by":"crossref","unstructured":"Yang J, Cao S, Xiangli P, Li X, Zhang X (2022) Multi-dimensional data quick query for blockchain-based federated learning. In: Wireless algorithms, systems, and applications - 17th international conference, WASA 2022, Dalian, China, November 24-26, 2022, Proceedings, Part III. Lecture notes in computer science, pp 529\u2013540","DOI":"10.1007\/978-3-031-19211-1_43"},{"key":"2090_CR11","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00778-024-00896-3","volume":"2","author":"Y Tong","year":"2025","unstructured":"Tong Y, Zeng Y, Song Y, Pan X, Fan Z, Xue C, Zhou Z, Zhang X, Chen L, Xu Y, Xu K, Lv W (2025) Hu-fu: efficient and secure spatial queries over data federation. VLDB J 2:19","journal-title":"VLDB J"},{"key":"2090_CR12","doi-asserted-by":"crossref","unstructured":"Sahin C, Allard T, Akbarinia R, Abbadi AE, Pacitti E (2018) A differentially private index for range query processing in clouds. In: 34th IEEE international conference on data engineering, ICDE 2018, Paris, France, April 16-19, 2018, pp 857\u2013868","DOI":"10.1109\/ICDE.2018.00082"},{"key":"2090_CR13","doi-asserted-by":"publisher","first-page":"378","DOI":"10.14778\/3430915.3430927","volume":"3","author":"J Yang","year":"2020","unstructured":"Yang J, Wang T, Li N, Cheng X, Su S (2020) Answering multi-dimensional range queries under local differential privacy. Proc VLDB Endow 3:378\u2013390","journal-title":"Proc VLDB Endow"},{"key":"2090_CR14","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.14778\/3339490.3339496","volume":"10","author":"G Cormode","year":"2019","unstructured":"Cormode G, Kulkarni T, Srivastava D (2019) Answering range queries under local differential privacy. Proc VLDB Endow 10:1126\u20131138","journal-title":"Proc VLDB Endow"},{"issue":"11","key":"2090_CR15","doi-asserted-by":"publisher","first-page":"20648","DOI":"10.1109\/JIOT.2024.3371828","volume":"11","author":"EZ Zhang","year":"2024","unstructured":"Zhang EZ, Guan Y, Lu R, Zhang H (2024) An efficient heap tree-based range query scheme under local differential privacy. IEEE Internet Things J 11(11):20648\u201320659","journal-title":"IEEE Internet Things J"},{"key":"2090_CR16","first-page":"350","volume":"2007","author":"E Shi","year":"2007","unstructured":"Shi E, Bethencourt J, Chan T-H, Song DX, Perrig A (2007) Multi-dimensional range query over encrypted data. IEEE S&P 2007:350\u2013364","journal-title":"IEEE S&P"},{"key":"2090_CR17","doi-asserted-by":"crossref","unstructured":"Boneh D, Waters B (2007) Conjunctive, subset, and range queries on encrypted data. In: TCC , 2007. Lecture notes in computer science, pp 535\u2013554","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"2090_CR18","doi-asserted-by":"crossref","unstructured":"Demertzis I, Papadopoulos S, Papapetrou O, Deligiannakis A, Garofalakis MN (2016) Practical private range search revisited. In: Proceedings of the 2016 international conference on management of data, SIGMOD conference 2016, San Francisco, CA, USA, June 26 - July 01, 2016, pp 185\u2013198","DOI":"10.1145\/2882903.2882911"},{"key":"2090_CR19","doi-asserted-by":"crossref","unstructured":"Wang X, Ma J, Liu X, Deng RH, Miao Y, Zhu D, Ma Z (2020) Search me in the dark: privacy-preserving Boolean range query over encrypted spatial data. In: 39th IEEE conference on computer communications, INFOCOM 2020, Toronto, ON, Canada, July 6-9, 2020, pp 2253\u20132262","DOI":"10.1109\/INFOCOM41043.2020.9155505"},{"key":"2090_CR20","doi-asserted-by":"crossref","unstructured":"Wang X, Ma J, Li F, Liu X, Miao Y, Deng RH (2021) Enabling efficient spatial keyword queries on encrypted data with strong security guarantees. IEEE Trans. Inf. Forensics Secur., pp 4909\u20134923","DOI":"10.1109\/TIFS.2021.3118880"},{"key":"2090_CR21","first-page":"107","volume":"1","author":"W Yang","year":"2020","unstructured":"Yang W, Geng Y, Li L, Xie X, Huang L (2020) Achieving secure and dynamic range queries over encrypted cloud data. IEEE Trans Knowl Data Eng 1:107\u2013121","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2090_CR22","first-page":"314","volume":"2013","author":"P Wang","year":"2013","unstructured":"Wang P, Ravishankar CV (2013) Secure and efficient range queries on outsourced databases using rp-trees. IEEE ICDE 2013:314\u2013325","journal-title":"IEEE ICDE"},{"key":"2090_CR23","doi-asserted-by":"publisher","first-page":"3478","DOI":"10.1109\/TDSC.2021.3101120","volume":"5","author":"Y Zheng","year":"2022","unstructured":"Zheng Y, Lu R, Guan Y, Shao J, Zhu H (2022) Towards practical and privacy-preserving multi-dimensional range query over cloud. IEEE Trans Dependable Secur Comput 5:3478\u20133493","journal-title":"IEEE Trans Dependable Secur Comput"},{"key":"2090_CR24","doi-asserted-by":"publisher","first-page":"3766","DOI":"10.1109\/TSC.2023.3259642","volume":"5","author":"L Sun","year":"2023","unstructured":"Sun L, Zhang Y, Zheng Y, Song W, Lu R (2023) Towards efficient and privacy-preserving high-dimensional range query in cloud. IEEE Trans Serv Comput 5:3766\u20133781","journal-title":"IEEE Trans Serv Comput"},{"key":"2090_CR25","first-page":"357","volume":"1998","author":"BC Ooi","year":"1998","unstructured":"Ooi BC, Goh CH, Tan K (1998) Fast high-dimensional data search in incomplete databases. VLDB 1998:357\u2013367","journal-title":"VLDB"},{"key":"2090_CR26","doi-asserted-by":"crossref","unstructured":"Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: International conference on the theory and applications of cryptographic techniques, pp 223\u2013238","DOI":"10.1007\/3-540-48910-X_16"},{"key":"2090_CR27","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1109\/JIOT.2018.2871204","volume":"2","author":"R Lu","year":"2019","unstructured":"Lu R (2019) A new communication-efficient privacy-preserving range query scheme in fog-enhanced iot. IEEE Internet Things J 2:2497\u20132505","journal-title":"IEEE Internet Things J"},{"key":"2090_CR28","doi-asserted-by":"publisher","first-page":"4762","DOI":"10.1109\/JIOT.2020.3029472","volume":"6","author":"H Mahdikhani","year":"2021","unstructured":"Mahdikhani H, Lu R, Shao J, Ghorbani AA (2021) Using reduced paths to achieve efficient privacy-preserving range query in fog-based iot. IEEE Internet Things J 6:4762\u20134774","journal-title":"IEEE Internet Things J"},{"key":"2090_CR29","doi-asserted-by":"crossref","unstructured":"Mahdikhani H, Lu R, Zheng Y, Ghorbani A (2020) Achieving efficient and privacy-preserving range query in fog-enhanced iot with bloom filter. In: ICC 2020-2020 IEEE International Conference on Communications (ICC), pp 1\u20136","DOI":"10.1109\/ICC40277.2020.9148813"},{"key":"2090_CR30","doi-asserted-by":"publisher","first-page":"5220","DOI":"10.1109\/JIOT.2020.2977253","volume":"6","author":"H Mahdikhani","year":"2020","unstructured":"Mahdikhani H, Lu R, Zheng Y, Shao J, Ghorbani AA (2020) Achieving o(log$${^3}$$n) communication-efficient privacy-preserving range query in fog-based iot. IEEE Internet Things J 6:5220\u20135232","journal-title":"IEEE Internet Things J"},{"key":"2090_CR31","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1145\/93605.98741","volume":"1990","author":"N Beckmann","year":"1990","unstructured":"Beckmann N, Kriegel H, Schneider R, Seeger B (1990) The r*-tree: an efficient and robust access method for points and rectangles. SIGMOD 1990:322\u2013331","journal-title":"SIGMOD"},{"key":"2090_CR32","doi-asserted-by":"crossref","unstructured":"Zheng Y, Lu R, Zhu H, Zhang S, Guan Y, Shao J, Wang F, Li H (2023) Setrknn: efficient and privacy-preserving set reverse knn query in cloud. IEEE Trans Inf Forensics Secur 888\u2013903","DOI":"10.1109\/TIFS.2022.3231785"},{"key":"2090_CR33","doi-asserted-by":"publisher","first-page":"16243","DOI":"10.1109\/JIOT.2021.3096674","volume":"22","author":"Y Guan","year":"2021","unstructured":"Guan Y, Lu R, Zheng Y, Zhang S, Shao J, Wei G (2021) Toward privacy-preserving cybertwin-based spatiotemporal keyword query for ITS in 6g era. IEEE Internet Things J 22:16243\u201316255","journal-title":"IEEE Internet Things J"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-02090-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-025-02090-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-025-02090-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T06:39:35Z","timestamp":1760683175000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-025-02090-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["2090"],"URL":"https:\/\/doi.org\/10.1007\/s12083-025-02090-w","relation":{},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"type":"print","value":"1936-6442"},{"type":"electronic","value":"1936-6450"}],"subject":[],"published":{"date-parts":[[2025,9]]},"assertion":[{"value":"21 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 August 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"278"}}