OblivGM: Oblivious Attributed Subgraph Matching as a Cloud Service
Songlei Wang, Yifeng Zheng, Xiaohua Jia, Hejiao Huang and, Cong Wang

TL;DR
OblivGM is a cloud-based system that enables privacy-preserving attributed subgraph matching on large graphs, balancing strong security with practical query performance of a few seconds.
Contribution
It introduces OblivGM, a novel system combining attributed graph modeling and lightweight cryptography to securely support flexible subgraph matching queries in the cloud.
Findings
Provides strong data confidentiality and query privacy guarantees.
Achieves query latency of a few seconds on real-world datasets.
Supports both equality and range predicates in subgraph queries.
Abstract
In recent years there has been growing popularity of leveraging cloud computing for storing and querying attributed graphs, which have been widely used to model complex structured data in various applications. Such trend of outsourced graph analytics, however, is accompanied with critical privacy concerns regarding the information-rich and proprietary attributed graph data. In light of this, we design, implement, and evaluate OblivGM, a new system aimed at oblivious graph analytics services outsourced to the cloud. OblivGM focuses on the support for attributed subgraph matching, one popular and fundamental graph query functionality aiming to retrieve from a large attributed graph subgraphs isomorphic to a small query graph. Built from a delicate synergy of insights from attributed graph modelling and advanced lightweight cryptography, OblivGM protects the confidentiality of data content…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data · Advanced Graph Neural Networks · Graph Theory and Algorithms
