2026· IEEE Transactions on Network Science and Engineering· Vol 13, pp. 10758-10775· 0 citations· 81 references
Computer Science
Abstract
Deploying outsourced graph neural network (GNN) inference services in the cloud is gaining widespread application across various fields, such as fraud detection and social network analysis. Cloud servers utilize outsourced model to analyze the graph data of data owners, enabling data owners to enjoy high-quality GNN inference services. However, this approach leads to privacy concerns regarding GNN models, graph data and inference results. To address the privacy issues, some privacy-preserving GNN inference schemes have been proposed. But the existing schemes are only applicable to graph convolutional network and not to graph attention network (GAT) with stronger expressive power. Therefore, we propose a secure GAT inference scheme (SecGAT) for outsourcing scenarios. First, we represent the Beaver triple-based multiplication process as a two-phase multiplication, which allows us to combine specific algorithms to optimize the communication overhead. Then, we design a graph data encryption method to protect the privacy of outsourced graph data. Finally, we propose a series of customized algorithms for secure GAT inference. Based on the proposed building blocks, we construct a complete GAT inference process. Rigorous security analysis and extensive evaluations demonstrate the effectiveness of our scheme. By comparing the core algorithms, our scheme can improve computational efficiency by more than 20% and reduce communication overhead by 20%−40% compared to existing schemes.
SaFeGNN is proposed, a Secure and Fair Federated Graph Neural Network framework that jointly enforces privacy protection and fairness guarantees and secures the communication process via additive secret sharing and client-level differential privacy, achieving stronger security guarantees compared to existing solutions.
Jia-Qiang Chen, He Zhang, Xiao-Ning Liu et al.· Journal of Cybersecurity and...· 0 citations
Experiments on four benchmarks for node classification and link prediction show that PriDyG consistently outperforms geometrically decaying baselines under the same privacy budget and matches the utility of naive per-update retraining while reducing cumulative privacy cost by up to three orders of magnitude.
This paper shows that even when a relation is fully or partially hidden, its existence leaves structural traces in the public graph that can be exploited to recover it with high accuracy, and proposes a link inference attack that operates on the topology of the public graph.
Emna Bouguerra, Ibtissam Harrouche, Ferran Alborch et al.· 0 citations
Large-scale graph data are widely used in research and industry, where keyword search serves as a fundamental query paradigm. To reduce costs, data owners commonly outsource graph storage and query processing to cloud service providers, raising concerns about result integrity. Recently, an authenticated graph keyword s...
Hong-Guang Zhao, Xu Yang, Saiyu Qi et al.· IEEE Transactions on Network...· 0 citations
This report systematically presents attack methodologies, defense mechanisms, security proofs, and experimental evaluations on seven real-world datasets as well as introducing BlindGES, an enhanced scheme incorporating a Merge-and-Divide mechanism and two-level multimap index that reduces one-to-one mappings to below 2...
A latency-optimal adaptive split inference framework for privacy-preserving cloud-edge-end collaboration, which jointly models plaintext prefix execution, encryption, communication, edge-side FHE execution, and cloud-side FHE completion, and supports both convolution-level and block-level split granularities.
Yi Li, Peng Zhang, M. Au· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.