TGHE: Template-based Graph Homomorphic Encryption for Privacy-Preserving GNN Inference in Edge-Cloud Systems
arXiv:2606.26664v1 Announce Type: cross Abstract: Existing homomorphic encryption (HE)-based GNN systems adopt a graph-centric paradigm that couples per-query cost to global graph size, limiting evaluations to at most ~20k nodes and making them incompatible with dynamic, large-scale financial...
What Happened
Researchers have introduced TGHE (Template-based Graph Homomorphic Encryption), a novel framework that decouples the computational cost of privacy-preserving Graph Neural Network (GNN) inference from the size of the global graph. Existing HE-based GNN systems operate under a "graph-centric" paradigm, where every query incurs costs proportional to the entire graph—limiting practical deployments to graphs with roughly 20,000 nodes. TGHE shifts to a "template-centric" approach, pre-encrypting reusable graph templates rather than the full graph structure. This allows edge-cloud systems to process queries against large, dynamic graphs (e.g., financial transaction networks with millions of nodes) without re-encrypting the entire dataset per query. The paper demonstrates that TGHE reduces per-query computation by orders of magnitude while maintaining strong privacy guarantees against honest-but-curious cloud providers.
Why It Matters
This work addresses a fundamental bottleneck in private GNN inference: the tension between graph scale and cryptographic overhead. Financial fraud detection, recommendation systems, and social network analysis increasingly rely on GNNs, but these applications often involve proprietary or sensitive graph data that cannot be exposed to cloud servers. Prior HE approaches made this impractical for real-world graphs—20k nodes is trivial compared to the millions of nodes in production systems. TGHE’s template-based design is particularly clever because it exploits the fact that many GNN queries share common structural patterns (e.g., subgraph sampling for mini-batch training). By pre-encrypting these templates, the system amortizes the heavy cryptographic work across many queries, making privacy-preserving GNN inference economically viable for large-scale deployments.
Implications for AI Practitioners
For ML engineers building privacy-sensitive applications: TGHE removes a major scalability barrier. If you are deploying GNNs for fraud detection in banking or user recommendation in e-commerce, you can now consider HE-based cloud inference without capping your graph size at 20k nodes. The template approach also naturally supports dynamic graphs—new nodes and edges can be added without re-encrypting the entire structure, which is critical for real-time financial networks. For infrastructure architects: The edge-cloud split is crucial. TGHE assumes a trusted edge device (e.g., a bank’s on-premise server) performs template generation and encryption, while the cloud handles heavy GNN computation on encrypted data. This aligns with existing compliance requirements (e.g., GDPR, financial regulations) where raw data cannot leave the edge. For researchers: TGHE opens a new design space. The template concept could extend beyond GNNs to other graph-based ML workloads (e.g., graph transformers, knowledge graph embeddings). However, the paper’s evaluation focuses on static templates—future work should explore adaptive templates for graphs with rapidly shifting structure.Key Takeaways
- TGHE solves the graph-size bottleneck in homomorphic encryption for GNNs by pre-encrypting reusable templates instead of the full graph, enabling inference on graphs with millions of nodes.
- Per-query computational cost is decoupled from global graph size, making private GNN inference economically viable for production-scale financial and social networks.
- The edge-cloud architecture preserves data privacy while offloading heavy computation, aligning with regulatory requirements for sensitive data.
- Practitioners should watch for future work on adaptive templates for highly dynamic graphs, but TGHE is immediately applicable for static or slowly evolving graph structures.