{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T05:12:19Z","timestamp":1771477939901,"version":"3.50.1"},"reference-count":35,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T00:00:00Z","timestamp":1760313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026,2,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>As real-world networks continue to evolve and expand, edge-labeled graphs have garnered attention for their capability to capture information more effectively in complex networks. To enhance the speed of queries on networks, researchers often opt to outsource complex and large amounts of network data to cloud servers. However, this approach raises concerns regarding the security and privacy of sensitive information inherent to the graph. This paper presents an innovative and practical privacy-preserving scheme for label-constrained reachability queries on edge-labeled graphs. To safeguard the privacy and security of sensitive information in the graph, we employ a range of encryption technologies to construct a secure label-constrained index. To ensure the privacy of query results, we design three functions based on symmetric homomorphic encryption. These functions effectively convert the label query problem on the index into a computational task with ciphertexts. This approach ensures the confidentiality of sensitive information while enabling efficient and accurate processing of label-constrained reachability queries. Comprehensive security analysis, complexity analysis, and simulation experiments utilizing real datasets collectively confirm the effectiveness of the proposed scheme in enabling privacy-preserving label-constrained reachability queries in cloud environments.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaf116","type":"journal-article","created":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T12:14:43Z","timestamp":1758716083000},"page":"307-319","source":"Crossref","is-referenced-by-count":0,"title":["Privacy-preserving label-constrained reachability queries for large graphs in cloud environments"],"prefix":"10.1093","volume":"69","author":[{"given":"Zenglu","family":"Li","sequence":"first","affiliation":[{"name":"Network Technology Center Sanming , Sanming University, No. 25 Jingdong Road, Sanming, Fujian 365004,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyu","family":"Guo","sequence":"additional","affiliation":[{"name":"Network Technology Center Sanming , Sanming University, No. 25 Jingdong Road, Sanming, Fujian 365004,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Wu","sequence":"additional","affiliation":[{"name":"Network Technology Center Sanming , Sanming University, No. 25 Jingdong Road, Sanming, Fujian 365004,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhanghua","family":"Xu","sequence":"additional","affiliation":[{"name":"Academy of Geography and Ecological Environment , College of Environment and Safety Engineering, Fuzhou University, No. 2 Wulongjiang North Avenue, Fuzhou University Town, Fuzhou 350108,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,10,13]]},"reference":[{"key":"2026021823462754200_ref1","first-page":"123","article-title":"Computing label-constraint reachability in graph databases","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"Jin"},{"key":"2026021823462754200_ref2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.is.2013.10.003","article-title":"Efficient processing of label-constraint reachability queries in large graphs","volume":"40","author":"Zou","year":"2014","journal-title":"Inform Syst"},{"key":"2026021823462754200_ref3","first-page":"345","article-title":"Landmark indexing for evaluation of label-constrained reachability queries","volume-title":"2017 ACM SIGMOD International Conference on Management of Data","author":"Valstar"},{"key":"2026021823462754200_ref4","doi-asserted-by":"crossref","first-page":"812","DOI":"10.14778\/3380750.3380753","article-title":"Answering billion-scale label-constrained reachability queries within microsecond","volume":"136","author":"Peng","year":"2020","journal-title":"Proc VLDB Endow"},{"key":"2026021823462754200_ref5","first-page":"67","article-title":"A reachability index for recursive label-concatenated graph queries","volume-title":"IEEE International Conference on Data Engineering","author":"Zhang","year":"2023"},{"key":"2026021823462754200_ref6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/s00778-021-00695-0","article-title":"Answering reachability and K-reach queries on large graphs with label constraints","volume":"311","author":"Peng","year":"2022","journal-title":"VLDB J"},{"key":"2026021823462754200_ref7","first-page":"153","article-title":"Preserving the privacy of sensitive relationships in graph data","volume-title":"International Workshop on Privacy, Security, and Trust in KDD","author":"Zheleva","year":"2007"},{"key":"2026021823462754200_ref8","first-page":"506","article-title":"Preserving privacy in social networks against neighborhood attacks","volume-title":"IEEE International Conference on Data Engineering","author":"Zhou","year":"2008"},{"key":"2026021823462754200_ref9","first-page":"577","article-title":"Structured encryption and controlled disclosure","volume-title":"International Conference on the Theory and Application of Cryptology and Information Security","author":"Chase"},{"key":"2026021823462754200_ref10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-319-05810-8_14","article-title":"Privacy-preserving reachability query services","volume-title":"International Conference on Database Systems for Advanced Applications","author":"Yin","year":"2014"},{"key":"2026021823462754200_ref11","first-page":"504","article-title":"Grecs: graph encryption for approximate shortest distance queries","volume-title":"ACM SIGSAC Conference on Computer and Communications Security","author":"Meng","year":"2015"},{"key":"2026021823462754200_ref12","article-title":"Secure indexes","author":"Goh"},{"key":"2026021823462754200_ref13","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1007\/11496137_30","article-title":"Privacy preserving keyword searches on remote encrypted data","volume-title":"International Conference on Applied Cryptography and Network Security","author":"Chang","year":"2005"},{"key":"2026021823462754200_ref14","first-page":"79","article-title":"Searchable symmetric encryption: improved definitions and efficient constructions","volume-title":"ACM Conference on Computer and Communications Security","author":"Curtmola","year":"2006"},{"key":"2026021823462754200_ref15","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":"2026021823462754200_ref16","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":"181","author":"Liu","year":"2021","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2026021823462754200_ref17","doi-asserted-by":"crossref","first-page":"1729","DOI":"10.1109\/JSYST.2023.3238809","article-title":"Privacy-preserving shortest distance query for dynamic large-scale road network","volume":"172","author":"Sun","year":"2023","journal-title":"IEEE Syst J"},{"key":"2026021823462754200_ref18","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/TSC.2024.3382954","article-title":"Enabling privacy-preserving KK-hop reachability query over encrypted graphs","volume":"173","author":"Song","year":"2024","journal-title":"IEEE Trans Serv Comput"},{"key":"2026021823462754200_ref19","first-page":"1660","article-title":"CryptGraph: an efficient privacy-enhancing solution for accurate shortest path retrieval in cloud environments","volume-title":"ACM Asia Conference on Computer and Communications Security","author":"Wang","year":"2024"},{"key":"2026021823462754200_ref20","first-page":"470","article-title":"ARROW: approximating reachability using random walks over web-scale graphs","volume-title":"IEEE International Conference on Data Engineering","author":"Sengupta","year":"2019"},{"key":"2026021823462754200_ref21","first-page":"3370","article-title":"Fast reachability query computation on big attributed graphs","volume-title":"IEEE International Conference on Big Data","author":"Yung","year":"2016"},{"key":"2026021823462754200_ref22","first-page":"1463","article-title":"Efficiently answering regular simple path queries on large labeled networks","volume-title":"International Conference on Management of Data","author":"Wadhwa","year":"2019"},{"key":"2026021823462754200_ref23","first-page":"902","article-title":"Time-dependent hop labeling on road network","volume-title":"IEEE International Conference on Data Engineering (ICDE)","author":"Li","year":"2019"},{"key":"2026021823462754200_ref24","first-page":"1979","article-title":"Achieving efficient and privacy-preserving ($\\alpha $,$\\beta $)-core query over bipartite graphs in cloud","volume":"203","author":"Guan","year":"2022","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2026021823462754200_ref25","doi-asserted-by":"crossref","first-page":"2750","DOI":"10.1109\/TDSC.2023.3317401","article-title":"kTCQ: achieving privacy-preserving k-truss community queries over outsourced data","volume":"214","author":"Guan","year":"2024","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2026021823462754200_ref26","doi-asserted-by":"crossref","first-page":"4146","DOI":"10.1109\/TIFS.2024.3376201","article-title":"Privacy-preserving approximate minimum community search on large networks","volume":"19","author":"Sun","year":"2024","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"2026021823462754200_ref27","doi-asserted-by":"crossref","first-page":"1338","DOI":"10.1137\/S0097539702403098","article-title":"Reachability and distance queries via 2-hop labels","volume":"325","author":"Cohen","year":"2003","journal-title":"SIAM J Comput"},{"key":"2026021823462754200_ref28","first-page":"349","article-title":"Fast exact shortest-path distance queries on large networks by pruned landmark Labeling","volume-title":"ACM SIGMOD International Conference on Management of Data","author":"Akiba","year":"2013"},{"key":"2026021823462754200_ref29","doi-asserted-by":"crossref","first-page":"5220","DOI":"10.1109\/JIOT.2020.2977253","article-title":"Achieving O(log3n) communication-efficient privacy-preserving range query in fog-based IoT","volume":"76","author":"Mahdikhani","year":"2020","journal-title":"IEEE Internet Things J"},{"key":"2026021823462754200_ref30","first-page":"2501","article-title":"Efficient and privacy-preserving similarity range query over encrypted time series data","volume":"194","author":"Zheng","year":"2021","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"2026021823462754200_ref31","first-page":"4146\u201360","article-title":"Privacy-preserving approximate minimum community search on large networks","volume-title":"IIEEE Trans Inf Forensics Secur","author":"Sun","year":"2024"},{"key":"2026021823462754200_ref32","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":"134","author":"Shen","year":"2018","journal-title":"IEEE Trans Inf Forensics Secur"},{"key":"2026021823462754200_ref33","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TSUSC.2017.2704163","article-title":"Graph encryption for top-K nearest keyword search queries on cloud","volume":"24","author":"Liu","year":"2017","journal-title":"IEEE Trans Sustain Comput"},{"key":"2026021823462754200_ref34","doi-asserted-by":"crossref","first-page":"102456","DOI":"10.1016\/j.cose.2021.102456","article-title":"Constrained top-k nearest fuzzy keyword queries on encrypted graph in road network","volume":"111","author":"Sun","year":"2021","journal-title":"Comput & Secur"},{"key":"2026021823462754200_ref35","first-page":"1","article-title":"The network data repository with interactive graph analytics and visualization","volume-title":"AAAI Conference on Artificial Intelligence","author":"Rossi","year":"2015"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/2\/307\/64660664\/bxaf116.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/69\/2\/307\/64660664\/bxaf116.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T04:46:36Z","timestamp":1771476396000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/69\/2\/307\/8285025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,13]]},"references-count":35,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025,10,13]]},"published-print":{"date-parts":[[2026,2,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaf116","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2026,2]]},"published":{"date-parts":[[2025,10,13]]}}}