CRAIJun 25

TGHE: Template-based Graph Homomorphic Encryption for Privacy-Preserving GNN Inference in Edge-Cloud Systems

arXiv:2606.266645.3
Predicted impact top 67% in CR · last 90 daysOriginality Highly original
AI Analysis

Enables practical encrypted GNN inference on large-scale dynamic graphs for edge-cloud systems, addressing a critical scalability bottleneck in privacy-preserving machine learning.

TGHE introduces an ego-centric framework for privacy-preserving GNN inference that decouples per-query cost from global graph size, achieving a 66.9x speedup over sequential encrypted baseline on a 3.7M-node financial graph with negligible accuracy loss.

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 graphs. We propose TGHE (Template-based Graph Homomorphic Encryption), an ego-centric framework that resolves this by exploiting a template phenomenon: local computation trees in transaction graphs converge into a small set of structural shapes. TGHE canonicalizes ego-graphs at the edge and packs structurally identical trees into shared CKKS ciphertexts for SIMD-parallel encrypted inference, with two long-tail optimizers (Approximate Template Fitting and Topology Collapse) ensuring full SIMD coverage. On DGraphFin (3.7M nodes, 4.3M edges), TGHE-Collapse achieves a 66.9x speedup over the sequential encrypted baseline with less than 0.002 AUC loss.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes