{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T04:10:32Z","timestamp":1763007032583,"version":"3.45.0"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819530540","type":"print"},{"value":"9789819530557","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T00:00:00Z","timestamp":1763078400000},"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-3055-7_11","type":"book-chapter","created":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T04:07:09Z","timestamp":1763006829000},"page":"134-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-Preserving Shortest Path Queries on\u00a0Encrypted Attributed IIoT Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-8204-4247","authenticated-orcid":false,"given":"Weixiao","family":"Wang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5427-5200","authenticated-orcid":false,"given":"Qing","family":"Fan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0962-4464","authenticated-orcid":false,"given":"Yajie","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7684-8540","authenticated-orcid":false,"given":"Chuan","family":"Zhang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3277-3887","authenticated-orcid":false,"given":"Liehuang","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,14]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-642-17373-8_33","volume-title":"Advances in Cryptology - ASIACRYPT 2010","author":"M Chase","year":"2010","unstructured":"Chase, M., Kamara, S.: Structured encryption and controlled disclosure. In: Abe, M. (ed.) ASIACRYPT 2010. LNCS, vol. 6477, pp. 577\u2013594. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17373-8_33"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Curtmola, R., Garay, J., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 79\u201388 (2006)","DOI":"10.1145\/1180405.1180417"},{"issue":"7","key":"11_CR4","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":"11_CR5","doi-asserted-by":"crossref","unstructured":"Falzon, F., Ghosh, E., Paterson, K.G., Tamassia, R.: PathGES: an efficient and secure graph encryption scheme for shortest path queries. In: Proceedings of the 31th ACM Conference on Computer and Communications Security (2024)","DOI":"10.1145\/3658644.3670305"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Falzon, F., Paterson, K.G.: An efficient query recovery attack against a graph encryption scheme. In: European Symposium on Research in Computer Security, pp. 325\u2013345. Springer (2022)","DOI":"10.1007\/978-3-031-17140-6_16"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Ghosh, E., Kamara, S., Tamassia, R.: Efficient graph encryption scheme for shortest path queries. In: Proceedings of the 2021 ACM Asia Conference on Computer and Communications Security, pp. 516\u2013525 (2021)","DOI":"10.1145\/3433210.3453099"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Lai, S., Yuan, X., Sun, S.F., Liu, J.K., Liu, Y., Liu, D.: Graphse$$^2$$: an encrypted graph database for privacy-preserving social search. In: Proceedings of the 2019 ACM Asia Conference on Computer and Communications Security, pp. 41\u201354 (2019)","DOI":"10.1145\/3321705.3329803"},{"issue":"01","key":"11_CR9","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(01), 192\u2013204 (2021)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"11_CR10","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)","DOI":"10.1145\/2810103.2813672"},{"issue":"4","key":"11_CR11","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."},{"key":"11_CR12","unstructured":"Song, D.X., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Proceeding 2000 IEEE Symposium on Security and Privacy, S &P 2000, pp. 44\u201355. IEEE (2000)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Stefanov, E., Papamanthou, C., Shi, E.: Practical dynamic searchable encryption with small leakage. Cryptology ePrint Archive (2013)","DOI":"10.14722\/ndss.2014.23298"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-319-70972-7_5","volume-title":"Financial Cryptography and Data Security","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Ren, K., Du, M., Li, Q., Mohaisen, A.: SecGDB: graph encryption for exact shortest distance queries with efficient updates. In: Kiayias, A. (ed.) FC 2017. LNCS, vol. 10322, pp. 79\u201397. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70972-7_5"},{"key":"11_CR15","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."},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Yi, P., Fan, Z., Yin, S.: Privacy-preserving reachability query services for sparse graphs. In: 2014 IEEE 30th International Conference on Data Engineering Workshops, pp. 32\u201335. IEEE (2014)","DOI":"10.1109\/ICDEW.2014.6818298"}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-3055-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T04:07:12Z","timestamp":1763006832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-3055-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,14]]},"ISBN":["9789819530540","9789819530557"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-3055-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,14]]},"assertion":[{"value":"14 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Macao","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":"4 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ksem2025.scimeeting.cn\/en\/web\/index\/27434","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}