{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T01:56:18Z","timestamp":1761184578437,"version":"build-2065373602"},"publisher-location":"Singapore","reference-count":35,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819535392"},{"type":"electronic","value":"9789819535408"}],"license":[{"start":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T00:00:00Z","timestamp":1761177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T00:00:00Z","timestamp":1761177600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-981-95-3540-8_24","type":"book-chapter","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T13:33:20Z","timestamp":1761140000000},"page":"444-462","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving K-Hop Shortest Path Query on\u00a0Encrypted Graphs Based on\u00a0Graph Pruning"],"prefix":"10.1007","author":[{"given":"Ya","family":"Gao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chao","family":"Mu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,23]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Akiba, T., Iwata, Y., Yoshida, Y.: Fast exact shortest-path distance queries on large networks by pruned landmark labeling. In: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data, pp. 349\u2013360 (2013)","key":"24_CR1","DOI":"10.1145\/2463676.2465315"},{"doi-asserted-by":"crossref","unstructured":"Anirban, S., Wang, J., Islam, M.S.: Experimental evaluation of indexing techniques for shortest distance queries on road networks. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 624\u2013636. IEEE (2023)","key":"24_CR2","DOI":"10.1109\/ICDE55515.2023.00054"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00778-013-0346-6","volume":"23","author":"J Cheng","year":"2014","unstructured":"Cheng, J., Shang, Z., Cheng, H., Wang, H., Yu, J.X.: Efficient processing of k-hop reachability queries. VLDB J. 23(2), 227\u2013252 (2014)","journal-title":"VLDB J."},{"issue":"9","key":"24_CR4","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":"24_CR5","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":"24_CR6","doi-asserted-by":"publisher","first-page":"102228","DOI":"10.1109\/ACCESS.2023.3316602","volume":"11","author":"A D\u2019ascenzo","year":"2023","unstructured":"D\u2019ascenzo, A., D\u2019emidio, M.: Top-k distance queries on large time-evolving graphs. IEEE Access 11, 102228\u2013102242 (2023)","journal-title":"IEEE Access"},{"issue":"4","key":"24_CR7","doi-asserted-by":"publisher","first-page":"2633","DOI":"10.1007\/s11276-024-03692-7","volume":"30","author":"J Guo","year":"2024","unstructured":"Guo, J., Sun, J.: Secure shortest distance queries over encrypted graph in cloud computing. Wireless Netw. 30(4), 2633\u20132646 (2024)","journal-title":"Wireless Netw."},{"doi-asserted-by":"crossref","unstructured":"Hu, M., Chen, L., Chen, G., Mu, Y., Deng, R.H.: A pruned pendant vertex based index for shortest distance query under structured encrypted graph. IEEE Trans. Inf. Forensics Secur. (2024)","key":"24_CR8","DOI":"10.1109\/TIFS.2024.3414156"},{"issue":"10","key":"24_CR9","doi-asserted-by":"publisher","first-page":"10650","DOI":"10.1109\/JIOT.2020.3006523","volume":"7","author":"M Kumar","year":"2020","unstructured":"Kumar, M., Chand, S.: A secure and efficient cloud-centric internet-of-medical-things-enabled smart healthcare system with public verifiability. IEEE Internet Things J. 7(10), 10650\u201310659 (2020)","journal-title":"IEEE Internet Things J."},{"doi-asserted-by":"crossref","unstructured":"Lai, Z., Peng, Y., Yang, S., Lin, X., Zhang, W.: PEFP: efficient k-hop constrained st simple path enumeration on FPGA. In: 2021 IEEE 37th International Conference on Data Engineering (ICDE), pp. 1320\u20131331. IEEE (2021)","key":"24_CR10","DOI":"10.1109\/ICDE51399.2021.00118"},{"doi-asserted-by":"crossref","unstructured":"Li, P., Zhou, F., Xu, Z., Li, Y., Xu, J.: Privacy-preserving top-k nearest keyword search queryies over encrypted graph data. In: 2021 IEEE 6th International Conference on Signal and Image Processing (ICSIP), pp. 531\u2013537. IEEE (2021)","key":"24_CR11","DOI":"10.1109\/ICSIP52628.2021.9688986"},{"issue":"1","key":"24_CR12","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1109\/TDSC.2018.2880981","volume":"18","author":"C Liu","year":"2018","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 (2018)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"3","key":"24_CR13","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1109\/TKDE.2017.2773492","volume":"30","author":"H Liu","year":"2017","unstructured":"Liu, H., Jin, C., Yang, B., Zhou, A.: Finding top-k shortest paths with diversity. IEEE Trans. Knowl. Data Eng. 30(3), 488\u2013502 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"24_CR14","first-page":"998","volume":"35","author":"T Liu","year":"2021","unstructured":"Liu, T., et al.: Towards indoor temporal-variation aware shortest path query. IEEE Trans. Knowl. Data Eng. 35(1), 998\u20131012 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"24_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1109\/TDSC.2016.2536601","volume":"15","author":"X Liu","year":"2016","unstructured":"Liu, X., Choo, K.K.R., Deng, R.H., Lu, R., Weng, J.: Efficient and privacy-preserving outsourced calculation of rational numbers. IEEE Trans. Dependable Secure Comput. 15(1), 27\u201339 (2016)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"24_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/978-3-030-88428-4_3","volume-title":"Computer Security \u2013 ESORICS 2021","author":"C Lv","year":"2021","unstructured":"Lv, C., Wang, J., Sun, S.-F., Wang, Y., Qi, S., Chen, X.: Efficient multi-client order-revealing encryption and its applications. In: Bertino, E., Shulman, H., Waidner, M. (eds.) ESORICS 2021. LNCS, vol. 12973, pp. 44\u201363. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88428-4_3"},{"doi-asserted-by":"crossref","unstructured":"Meng, X., Kamara, S., Nissim, K., Kollios, G.: Grecs: graph encryption for approximate shortest distance queries. In: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, pp. 504\u2013517 (2015)","key":"24_CR17","DOI":"10.1145\/2810103.2813672"},{"doi-asserted-by":"publisher","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: International Conference on the Theory and Applications of Cryptographic Techniques, pp. 223\u2013238. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48910-x_16","key":"24_CR18","DOI":"10.1007\/3-540-48910-x_16"},{"issue":"6","key":"24_CR19","first-page":"14","volume":"32","author":"C Pan","year":"2011","unstructured":"Pan, C., Wang, B.: Prospect of compass navigation system\u2019s application in internet of things. J. Telemetry Tracking Command 32(6), 14\u201317 (2011)","journal-title":"J. Telemetry Tracking Command"},{"doi-asserted-by":"crossref","unstructured":"Peng, Y., Lin, X., Zhang, Y., Zhang, W., Qin, L.: Answering reachability and k-reach queries on large graphs with label constraints. The VLDB J. 1\u201327 (2022)","key":"24_CR20","DOI":"10.1007\/s00778-021-00695-0"},{"issue":"6","key":"24_CR21","doi-asserted-by":"publisher","first-page":"812","DOI":"10.14778\/3380750.3380753","volume":"13","author":"Y Peng","year":"2020","unstructured":"Peng, Y., Zhang, Y., Lin, X., Qin, L., Zhang, W.: Answering billion-scale label-constrained reachability queries within microsecond. Proc. VLDB Endowment 13(6), 812\u2013825 (2020)","journal-title":"Proc. VLDB Endowment"},{"doi-asserted-by":"crossref","unstructured":"Peng, Y., Zhang, Y., Zhang, W., Lin, X., Qin, L.: Efficient probabilistic k-core computation on uncertain graphs. In: 2018 IEEE 34th International Conference on Data Engineering (ICDE), pp. 1192\u20131203. IEEE (2018)","key":"24_CR22","DOI":"10.1109\/ICDE.2018.00110"},{"issue":"12","key":"24_CR23","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.14778\/3229863.3229874","volume":"11","author":"X Qiu","year":"2018","unstructured":"Qiu, X., et al.: Real-time constrained cycle detection in large dynamic graphs. Proc. VLDB Endowment 11(12), 1876\u20131888 (2018)","journal-title":"Proc. VLDB Endowment"},{"doi-asserted-by":"crossref","unstructured":"Shen, M., Chen, S., Zhu, L., Xiao, R., Xu, K., Du, X.: Privacy-preserving graph encryption for approximate constrained shortest distance queries. In: 2019 IEEE Global Communications Conference (GLOBECOM), pp.\u00a01\u20136. IEEE (2019)","key":"24_CR24","DOI":"10.1109\/GLOBECOM38437.2019.9014247"},{"issue":"4","key":"24_CR25","doi-asserted-by":"publisher","first-page":"940","DOI":"10.1109\/TIFS.2017.2774451","volume":"13","author":"M Shen","year":"2017","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(4), 940\u2013953 (2017)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"doi-asserted-by":"crossref","unstructured":"Song, Y., Ge, X., Yu, J., Hao, R., Yang, M.: Enabling privacy-preserving k-hop reachability query over encrypted graphs. IEEE Trans. Serv. Comput. (2024)","key":"24_CR26","DOI":"10.1109\/TSC.2024.3382954"},{"doi-asserted-by":"crossref","unstructured":"Stann, F., Heidemann, J.: RMST: reliable data transport in sensor networks. In: Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003, pp. 102\u2013112. IEEE (2003)","key":"24_CR27","DOI":"10.1109\/SNPA.2003.1203361"},{"doi-asserted-by":"crossref","unstructured":"Wang, S., Xiao, X., Yang, Y., Lin, W.: Effective indexing for approximate constrained shortest path queries on large road networks (2016)","key":"24_CR28","DOI":"10.14778\/3015274.3015277"},{"key":"24_CR29","doi-asserted-by":"publisher","first-page":"3179","DOI":"10.1109\/TIFS.2022.3201392","volume":"17","author":"S Wang","year":"2022","unstructured":"Wang, S., Zheng, Y., Jia, X., Yi, X.: PeGraph: a system for privacy-preserving and efficient search over encrypted social graphs. IEEE Trans. Inf. Forensics Secur. 17, 3179\u20133194 (2022)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"issue":"22","key":"24_CR30","doi-asserted-by":"publisher","first-page":"22516","DOI":"10.1109\/JIOT.2022.3184045","volume":"9","author":"W Wang","year":"2022","unstructured":"Wang, W., Jia, Z., Xu, M., Li, S.: SPCS: strong privacy-preserving-constrained shortest distance queries on encrypted graphs. IEEE Internet Things J. 9(22), 22516\u201322528 (2022)","journal-title":"IEEE Internet Things J."},{"issue":"7","key":"24_CR31","doi-asserted-by":"publisher","first-page":"2759","DOI":"10.1109\/TKDE.2023.3346377","volume":"36","author":"Z Yu","year":"2024","unstructured":"Yu, Z., Yu, X., Koudas, N., Chen, Y., Liu, Y.: A distributed solution for efficient k shortest paths computation over dynamic road networks. IEEE Trans. Knowl. Data Eng. 36(7), 2759\u20132773 (2024)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"crossref","unstructured":"Yuan, L., Hao, K., Lin, X., Zhang, W.: Batch hop-constrained st simple path query processing in large graphs. In: 2024 IEEE 40th International Conference on Data Engineering (ICDE), pp. 2557\u20132569. IEEE (2024)","key":"24_CR32","DOI":"10.1109\/ICDE60146.2024.00201"},{"key":"24_CR33","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."},{"doi-asserted-by":"crossref","unstructured":"Zhang, J., Yang, S., Ouyang, D., Zhang, F., Lin, X., Yuan, L.: Hop-constrained st simple path enumeration on large dynamic graphs. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE), pp. 762\u2013775. IEEE (2023)","key":"24_CR34","DOI":"10.1109\/ICDE55515.2023.00064"},{"issue":"9","key":"24_CR35","doi-asserted-by":"publisher","first-page":"16517","DOI":"10.1109\/JIOT.2024.3352904","volume":"11","author":"X Zhao","year":"2024","unstructured":"Zhao, X., Wang, M., Jia, Z., Li, S.: Privacy-preserving any-hop cover shortest distance queries on encrypted graphs. IEEE Internet Things J. 11(9), 16517\u201316528 (2024)","journal-title":"IEEE Internet Things J."}],"container-title":["Lecture Notes in Computer Science","Information and Communications Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3540-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T22:03:32Z","timestamp":1761170612000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3540-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,23]]},"ISBN":["9789819535392","9789819535408"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3540-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,10,23]]},"assertion":[{"value":"23 October 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icics2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icics2025.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}