Privacy-preserving label-constrained reachability queries for large graphs in cloud environments

Abstract 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.

Authors

Institutions

Publication Details

Journal
The Computer Journal
Published
2025-09-24
DOI
https://doi.org/10.1093/comjnl/bxaf116
Primary Topic
Cryptography and Data Security
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Privacy-preserving label-constrained reachability queries for large graphs in cloud environments

Xiaohua Wu, Zenglu Li, Xiaoyu Guo, Zhanghua Xu
The Computer Journal
Cryptography and Data Security
article

Privacy-preserving label-constrained reachability queries for large graphs in cloud environments

Xiaohua Wu, Zenglu Li, Xiaoyu Guo, Zhanghua Xu
article en

Abstract

Abstract 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.

The Computer JournalVol. 69(2)
Sanming University (CN), Fuzhou University (CN)
Openalex Percentile: Top 85%
Cryptography and Data Security
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.