{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T08:22:56Z","timestamp":1770538976974,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T00:00:00Z","timestamp":1764374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T00:00:00Z","timestamp":1764374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 62072105"],"award-info":[{"award-number":["No. 62072105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["The VLDB Journal"],"published-print":{"date-parts":[[2026,1]]},"DOI":"10.1007\/s00778-025-00955-3","type":"journal-article","created":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T20:53:02Z","timestamp":1764449582000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Dynamic Hub Labeling for Shortest Distance Queries on Structured Encrypted Graphs"],"prefix":"10.1007","volume":"35","author":[{"given":"Mengdi","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lanxiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,29]]},"reference":[{"key":"955_CR1","doi-asserted-by":"crossref","unstructured":"Vieira, M.V., Fonseca, B.M., Damazio, R., Golgher, P.B., Reis, D.d.C., Ribeiro-Neto, B.: Efficient search ranking in social networks, in Proc. Sixteenth ACM Conf. on Conf. on Info. Knowl. Mgmt., pp. 563\u2013572 (2007)","DOI":"10.1145\/1321440.1321520"},{"key":"955_CR2","doi-asserted-by":"crossref","unstructured":"Li, J., Wang, X., Deng, K., Yang, X., Sellis, T., Yu, J.X.: Most influential community search over large social networks, in 2017 IEEE 33rd Intl. Conf. Data. Eng. (ICDE), pp. 871\u2013882 (2017)","DOI":"10.1109\/ICDE.2017.136"},{"key":"955_CR3","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/TIFS.2017.2774451","volume":"13","author":"M Shen","year":"2018","unstructured":"Shen, M., Ma, B., Zhu, L., Mijumbi, R., Du, X., Hu, J.: Cloud-based approximate constrained shortest distance queries over encrypted graphs with privacy protection. IEEE Trans. Inf. Forensics Secur. 13, 940\u2013953 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"955_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.ins.2019.07.082","volume":"506","author":"C Zhang","year":"2020","unstructured":"Zhang, C., Zhu, L., Xu, C., Sharif, K., Zhang, C., Liu, X.: PGAS: Privacy-preserving graph encryption for accurate constrained shortest distance queries. Inf. Sci. 506, 325\u2013345 (2020)","journal-title":"Inf. Sci."},{"issue":"1","key":"955_CR5","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TDSC.2018.2880981","volume":"18","author":"C Liu","year":"2021","unstructured":"Liu, C., Zhu, L., He, X., Chen, J.: Enabling privacy-preserving shortest distance queries on encrypted graph data. IEEE Trans. Dependable Secure Comput. 18(1), 192\u2013204 (2021)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"955_CR6","doi-asserted-by":"crossref","unstructured":"Fuchsbauer, G., Ghosal, R., Hauke, N., O\u2019Neill, A.: Approximate distance-comparison-preserving symmetric encryption, in Sec. Crypto. Networks, pp. 117\u2013144 (2022)","DOI":"10.1007\/978-3-031-14791-3_6"},{"key":"955_CR7","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Mao, R., Chao, P., Zhou, X.: Dynamic hub labeling for road networks, in 2021 IEEE 37th Intl. Conf. Data Eng. (ICDE), pp. 336\u2013347 (2021)","DOI":"10.1109\/ICDE51399.2021.00036"},{"issue":"2","key":"955_CR8","doi-asserted-by":"publisher","first-page":"1729","DOI":"10.1109\/JSYST.2023.3238809","volume":"17","author":"F Sun","year":"2023","unstructured":"Sun, F., Yu, J., Hao, R., Yang, M., Kong, F.: Privacy-preserving shortest distance query for dynamic large-scale road network. IEEE Syst. J. 17(2), 1729\u20131740 (2023)","journal-title":"IEEE Syst. J."},{"key":"955_CR9","doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Dynamic and historical shortest-path distance queries on large evolving networks by pruned landmark labeling, in Proc. 23rd Intl. Conf. WWW., pp. 237\u2013248 (2014)","DOI":"10.1145\/2566486.2568007"},{"key":"955_CR10","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00778-018-0499-4","volume":"27","author":"L Li","year":"2018","unstructured":"Li, L., Zheng, K., Wang, S., Hua, W., Zhou, X.: Go slow to go fast: minimal on-road time route scheduling with parking facilities using historical trajectory. VLDB J. 27, 321\u2013345 (2018)","journal-title":"VLDB J."},{"key":"955_CR11","doi-asserted-by":"crossref","unstructured":"Li, L., Wang, S., Zhou, X.: Time-dependent hop labeling on road network, in 2019 IEEE 35th Intl. Conf. Data Eng. (ICDE), pp. 902\u2013913 (2019)","DOI":"10.1109\/ICDE.2019.00085"},{"key":"955_CR12","doi-asserted-by":"crossref","unstructured":"Li, L., Zhang, M., Hua, W., Zhou, X.: Fast query decomposition for batch shortest path processing in road networks, in 2020 IEEE 36th Intl. Conf. Data Eng. (ICDE) pp. 1189\u20131200 (2020)","DOI":"10.1109\/ICDE48307.2020.00107"},{"key":"955_CR13","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Efficient batch processing of shortest path queries in road networks, in 2019 20th IEEE Intl. Conf. Mob. Data Mgmt. (MDM) pp. 100\u2013105 (2019)","DOI":"10.1109\/MDM.2019.00-69"},{"issue":"5","key":"955_CR14","doi-asserted-by":"publisher","first-page":"602","DOI":"10.14778\/3377369.3377371","volume":"13","author":"D Ouyang","year":"2020","unstructured":"Ouyang, D., Yuan, L., Qin, L., Chang, L., Zhang, Y., Lin, X.: Efficient shortest path index maintenance on dynamic road networks with theoretical guarantees. Proc. VLDB Endow. 13(5), 602\u2013615 (2020)","journal-title":"Proc. VLDB Endow."},{"key":"955_CR15","first-page":"915","volume":"20","author":"Y Qin","year":"2017","unstructured":"Qin, Y., Sheng, Q.Z., Falkner, N.J., Yao, L., Parkinson, S.: Efficient computation of distance labeling for decremental updates in large dynamic graphs. WWW. 20, 915\u2013937 (2017)","journal-title":"WWW."},{"key":"955_CR16","doi-asserted-by":"crossref","unstructured":"Ouyang, D., Qin, L., Chang, L., Lin, X., Zhang, Y., Zhu, Q.: When hierarchy meets 2-hop-labeling: Efficient shortest distance queries on road networks, in Proc. 2018 Intl. Conf. Mgmt. of Data, p. 709\u2013724 (2018)","DOI":"10.1145\/3183713.3196913"},{"key":"955_CR17","doi-asserted-by":"crossref","unstructured":"Zhang, M., Li, L., Hua, W., Zhou, X.: Efficient 2-hop labeling maintenance in dynamic small-world networks, in 2021 IEEE 37th Intl. Conf. Data Eng. (ICDE), pp. 133\u2013144 (2021)","DOI":"10.1109\/ICDE51399.2021.00019"},{"key":"955_CR18","unstructured":"Farhan, M., Wang, Q., Lin, Y., McKay, B.: Fast fully dynamic labelling for distance queries, VLDB J., pp. 1\u201324 (2022)"},{"key":"955_CR19","doi-asserted-by":"crossref","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure, in Proc. 16th Intl. Conf. Thry. Appl. Crypto. Info. Sec. (ASIACRYPT 2010), pp. 577\u2013594 (2010)","DOI":"10.1007\/978-3-642-17373-8_33"},{"key":"955_CR20","doi-asserted-by":"crossref","unstructured":"Meng, X., Kamara, S., Nissim, K., Kollios, G.: GRECS: Graph encryption for approximate shortest distance queries, in Proc. 22nd ACM SIGSAC Conf. Comput. Commn. Sec., pp. 504\u2013517 (2015)","DOI":"10.1145\/2810103.2813672"},{"key":"955_CR21","doi-asserted-by":"crossref","unstructured":"Ghosh, E., Kamara, S., Tamassia, R.: Efficient graph encryption scheme for shortest path queries, in Proc. 2021 ACM Asia Conf. Comput. Commn. Sec., pp. 516\u2013525 (2021)","DOI":"10.1145\/3433210.3453099"},{"key":"955_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ins.2022.05.015","volume":"605","author":"Y Xue","year":"2022","unstructured":"Xue, Y., Chen, L., Mu, Y., Zeng, L., Rezaeibagha, F., Deng, R.H.: Structured encryption for knowledge graphs. Inf. Sci. 605, 43\u201370 (2022)","journal-title":"Inf. Sci."},{"key":"955_CR23","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.future.2023.03.030","volume":"145","author":"Y Wu","year":"2023","unstructured":"Wu, Y., Chen, L.: Structured encryption for triangle counting on graph data. Futur. Gener. Comput. Syst. 145, 200\u2013210 (2023)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"9","key":"955_CR24","doi-asserted-by":"publisher","first-page":"2320","DOI":"10.1109\/TIFS.2018.2818651","volume":"13","author":"M Du","year":"2018","unstructured":"Du, M., Wang, Q., He, M., Weng, J.: Privacy-preserving indexing and query processing for secure dynamic cloud storage. IEEE Trans. Inf. Forensics Secur. 13(9), 2320\u20132332 (2018)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"7","key":"955_CR25","first-page":"3295","volume":"34","author":"M Du","year":"2020","unstructured":"Du, M., Wu, S., Wang, Q., Chen, D., Jiang, P., Mohaisen, A.: Graphshield: Dynamic large graphs for secure queries with forward privacy. IEEE Trans. Knowl. Data Eng. 34(7), 3295\u20133308 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"955_CR26","first-page":"370","volume":"2021","author":"M George","year":"2021","unstructured":"George, M., Kamara, S., Moataz, T.: Structured encryption and dynamic leakage suppression. Adv. Crypto. - EUROCRYPT 2021, 370\u2013396 (2021)","journal-title":"Adv. Crypto. - EUROCRYPT"},{"key":"955_CR27","unstructured":"Islam, M.S., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption ramification attack and mitigation. in Ndss, vol. 20, p. 12 (2012)"},{"key":"955_CR28","doi-asserted-by":"crossref","unstructured":"Cash, D., Grubbs, P., Perry, J., Ristenpart, T.: Leakage-abuse attacks against searchable encryption, in Proc. 22nd ACM SIGSAC Conf. Comput. Commn. Sec., pp. 668\u2013679 (2015)","DOI":"10.1145\/2810103.2813700"},{"key":"955_CR29","doi-asserted-by":"crossref","unstructured":"Kornaropoulos, E.M., Moyer, N., Papamanthou, C., Psomas, A.: Leakage inversion: Towards quantifying privacy in searchable encryption, in Proc. 2022 ACM SIGSAC Conf. Comput. Commn. Sec., pp. 1829\u20131842 (2022)","DOI":"10.1145\/3548606.3560593"},{"issue":"6","key":"955_CR30","doi-asserted-by":"publisher","first-page":"5220","DOI":"10.1109\/JIOT.2020.2977253","volume":"7","author":"H Mahdikhani","year":"2020","unstructured":"Mahdikhani, H., Lu, R., Zheng, Y., Shao, J., Ghorbani, A.A.: Achieving o(log\u00b3n) communication-efficient privacy-preserving range query in fog-based iot. IEEE Internet Things J. 7(6), 5220\u20135232 (2020)","journal-title":"IEEE Internet Things J."},{"issue":"4","key":"955_CR31","doi-asserted-by":"publisher","first-page":"2501","DOI":"10.1109\/TDSC.2021.3061611","volume":"19","author":"Y Zheng","year":"2021","unstructured":"Zheng, Y., Lu, R., Guan, Y., Shao, J., Zhu, H.: Efficient and privacy-preserving similarity range query over encrypted time series data. IEEE Trans. Dependable Secure Comput. 19(4), 2501\u20132516 (2021)","journal-title":"IEEE Trans. Dependable Secure Comput."}],"container-title":["The VLDB Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00955-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00778-025-00955-3","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00778-025-00955-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T07:27:27Z","timestamp":1770449247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00778-025-00955-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,29]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["955"],"URL":"https:\/\/doi.org\/10.1007\/s00778-025-00955-3","relation":{},"ISSN":["1066-8888","0949-877X"],"issn-type":[{"value":"1066-8888","type":"print"},{"value":"0949-877X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,29]]},"assertion":[{"value":"25 August 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 November 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2025","order":4,"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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}}],"article-number":"5"}}