{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T01:22:36Z","timestamp":1783128156735,"version":"3.54.6"},"reference-count":27,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T00:00:00Z","timestamp":1788220800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB2703001"],"award-info":[{"award-number":["2022YFB2703001"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Security"],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1016\/j.cose.2026.104932","type":"journal-article","created":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T23:38:45Z","timestamp":1776728325000},"page":"104932","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Privacy-preserving path constrained shortest distance queries on encrypted graphs"],"prefix":"10.1016","volume":"168","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0640-5986","authenticated-orcid":false,"given":"Yuwei","family":"Duan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5388-2228","authenticated-orcid":false,"given":"Jingjuan","family":"Yu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Minghui","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shundong","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cose.2026.104932_b1","series-title":"Graph Theory","author":"Bondy","year":"2008"},{"key":"10.1016\/j.cose.2026.104932_b2","series-title":"Advances in Cryptology-ASIACRYPT 2010: 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5-9, 2010. Proceedings 16","first-page":"577","article-title":"Structured encryption and controlled disclosure","author":"Chase","year":"2010"},{"issue":"5","key":"10.1016\/j.cose.2026.104932_b3","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1137\/S0097539702403098","article-title":"Reachability and distance queries via 2-hop labels","volume":"32","author":"Cohen","year":"2003","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.cose.2026.104932_b4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/j.future.2019.10.003","article-title":"A two-tier bipartite graph task allocation approach based on fuzzy clustering in cloud\u2013fog environment","volume":"103","author":"Gad-Elrab","year":"2020","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"10.1016\/j.cose.2026.104932_b5","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1109\/TSMC.2021.3073542","article-title":"SPPS: A search pattern privacy system for approximate shortest distance query of encrypted graphs in IIoT","volume":"52","author":"Ge","year":"2021","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10.1016\/j.cose.2026.104932_b6","series-title":"Foundations of Cryptography, Volume 2","author":"Goldreich","year":"2004"},{"key":"10.1016\/j.cose.2026.104932_b7","series-title":"2024 IEEE 40th International Conference on Data Engineering","first-page":"4532","article-title":"Querying shortest path on large time-dependent road networks with shortcuts","author":"Gong","year":"2024"},{"key":"10.1016\/j.cose.2026.104932_b8","first-page":"1","article-title":"Secure shortest distance queries over encrypted graph in cloud computing","author":"Guo","year":"2024","journal-title":"Wirel. Netw."},{"key":"10.1016\/j.cose.2026.104932_b9","doi-asserted-by":"crossref","DOI":"10.1109\/TIFS.2023.3283104","article-title":"Achieving privacy-preserving and verifiable support vector machine training in the cloud","author":"Hu","year":"2023","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10.1016\/j.cose.2026.104932_b10","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1016\/j.future.2016.10.004","article-title":"Design of a provably secure biometrics-based multi-cloud-server authentication scheme","volume":"68","author":"Kumari","year":"2017","journal-title":"Future Gener. Comput. Syst."},{"key":"10.1016\/j.cose.2026.104932_b11","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.future.2019.12.040","article-title":"Resource optimization scheduling and allocation for hierarchical distributed cloud service system in smart city","volume":"107","author":"Li","year":"2020","journal-title":"Future Gener. Comput. Syst."},{"issue":"1","key":"10.1016\/j.cose.2026.104932_b12","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TDSC.2018.2880981","article-title":"Enabling privacy-preserving shortest distance queries on encrypted graph data","volume":"18","author":"Liu","year":"2018","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"10.1016\/j.cose.2026.104932_b13","series-title":"2022 18th International Conference on Mobility, Sensing and Networking","first-page":"287","article-title":"Approximate shortest distance queries with advanced graph analytics over large-scale encrypted graphs","author":"Luo","year":"2022"},{"key":"10.1016\/j.cose.2026.104932_b14","doi-asserted-by":"crossref","unstructured":"Meng, Xianrui, Kamara, Seny, Nissim, Kobbi, Kollios, George, 2015. Grecs: Graph encryption for approximate shortest distance queries. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security. pp. 504\u2013517.","DOI":"10.1145\/2810103.2813672"},{"issue":"1","key":"10.1016\/j.cose.2026.104932_b15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1109\/TKDE.2012.253","article-title":"Approximate shortest distance computing: A query-dependent local landmark scheme","volume":"26","author":"Qiao","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.cose.2026.104932_b16","series-title":"Outsourced analysis of encrypted graphs in the cloud with privacy protection","author":"Selvaraj","year":"2023"},{"key":"10.1016\/j.cose.2026.104932_b17","series-title":"2019 IEEE Global Communications Conference","first-page":"1","article-title":"Privacy-preserving graph encryption for approximate constrained shortest distance queries","author":"Shen","year":"2019"},{"issue":"4","key":"10.1016\/j.cose.2026.104932_b18","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1109\/TIFS.2017.2774451","article-title":"Cloud-based approximate constrained shortest distance queries over encrypted graphs with privacy protection","volume":"13","author":"Shen","year":"2017","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"4","key":"10.1016\/j.cose.2026.104932_b19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2530531","article-title":"Shortest-path queries in static networks","volume":"46","author":"Sommer","year":"2014","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/j.cose.2026.104932_b20","doi-asserted-by":"crossref","DOI":"10.1109\/JSYST.2023.3238809","article-title":"Privacy-preserving shortest distance query for dynamic large-scale road network","author":"Sun","year":"2023","journal-title":"IEEE Syst. J."},{"issue":"1","key":"10.1016\/j.cose.2026.104932_b21","doi-asserted-by":"crossref","first-page":"29","DOI":"10.3390\/a17010029","article-title":"Navigating the maps: Euclidean vs. Road network distances in spatial queries","volume":"17","author":"Tatit","year":"2024","journal-title":"Algorithms"},{"issue":"22","key":"10.1016\/j.cose.2026.104932_b22","doi-asserted-by":"crossref","first-page":"22516","DOI":"10.1109\/JIOT.2022.3184045","article-title":"SPCS: Strong privacy-preserving-constrained shortest distance queries on encrypted graphs","volume":"9","author":"Wang","year":"2022","journal-title":"IEEE Internet Things J."},{"key":"10.1016\/j.cose.2026.104932_b23","series-title":"Financial Cryptography and Data Security: 21st International Conference, FC 2017, Sliema, Malta, April 3-7, 2017, Revised Selected Papers 21","first-page":"79","article-title":"SecGDB: Graph encryption for exact shortest distance queries with efficient updates","author":"Wang","year":"2017"},{"key":"10.1016\/j.cose.2026.104932_b24","doi-asserted-by":"crossref","unstructured":"Wei, Fang, 2010. TEDI: efficient shortest path query answering on graphs. In: Proceedings of the 2010 ACM SIGMOD International Conference on Management of Data. pp. 99\u2013110.","DOI":"10.1145\/1807167.1807181"},{"issue":"1","key":"10.1016\/j.cose.2026.104932_b25","article-title":"High performance computing simulation of intelligent logistics management based on shortest path algorithm","volume":"2022","author":"Wei","year":"2022","journal-title":"Comput. Intell. Neurosci."},{"key":"10.1016\/j.cose.2026.104932_b26","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.ins.2019.07.082","article-title":"PGAS: Privacy-preserving graph encryption for accurate constrained shortest distance queries","volume":"506","author":"Zhang","year":"2020","journal-title":"Inform. Sci."},{"key":"10.1016\/j.cose.2026.104932_b27","doi-asserted-by":"crossref","unstructured":"Zhu, Andy Diwen, Ma, Hui, Xiao, Xiaokui, Luo, Siqiang, Tang, Youze, Zhou, Shuigeng, 2013. Shortest path and distance queries on road networks: towards bridging theory and practice. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data. pp. 857\u2013868.","DOI":"10.1145\/2463676.2465277"}],"container-title":["Computers & Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404826001082?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167404826001082?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T01:10:59Z","timestamp":1783127459000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167404826001082"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,9]]},"references-count":27,"alternative-id":["S0167404826001082"],"URL":"https:\/\/doi.org\/10.1016\/j.cose.2026.104932","relation":{},"ISSN":["0167-4048"],"issn-type":[{"value":"0167-4048","type":"print"}],"subject":[],"published":{"date-parts":[[2026,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Privacy-preserving path constrained shortest distance queries on encrypted graphs","name":"articletitle","label":"Article Title"},{"value":"Computers & Security","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cose.2026.104932","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104932"}}