USENIX Security2024Top-tier venue
GraphGuard: Private Time-Constrained Pattern Detection Over Streaming Graphs in the Cloud
Songlei Wang, Yifeng Zheng, Xiaohua Jia
Abstract
Streaming graphs have seen wide adoption in diverse scenarios due to their superior ability to capture temporal interactions among entities. With the proliferation of cloud computing, it has become increasingly common to utilize the cloud for storing and querying streaming graphs. Among others, streaming graphs-based time-constrained pattern detection, which aims to continuously detect subgraphs matching a given query pattern within a sliding time window, benefits various applications such as credit card fraud detection and cyber-attack detection. Deploying such services on the cloud, however, entails severe security and privacy risks. This paper presents GraphGuard, the first system for privacy-preserving outsourcing of time-constrained pattern detection over streaming graphs. GraphGuard is constructed from a customized synergy of insights on graph modeling, lightweight secret sharing, edge differential privacy, and data encoding and padding, safeguarding the confidentiality of edge/vertex labels and the connections between vertices in the streaming graph and query patterns. We implement and evaluate GraphGuard on several real-world graph datasets. The evaluation results show that GraphGuard takes only a few seconds to securely process an encrypted query pattern over an encrypted snapshot of streaming graphs within a time window of size 50,000. Compared to a baseline built on generic secure multiparty computation, GraphGuard achieves up to 60× improvement in query latency and up to 98% savings in communication.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ebf9f9e9-501a-4d2d-814a-25de5e51f261Cited by top-tier papers2
- GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated GraphsXiaoyu Fan, Kun Chen, Jiping Yu, Xiaowei Zhu et al.VLDB 2025 · 3 citations
- GraphAce: Secure Two-Party Graph Analysis Achieving Communication EfficiencyJiping Yu, Kun Chen, Yunyi Chen, Xiaoyu Fan et al.USENIX Security 2025
Builds on20
- ABY3: A Mixed Protocol Framework for Machine LearningPayman Mohassel, Peter RindalCCS 2018 · 898 citations
- High-Throughput Semi-Honest Secure Three-Party Computation with an Honest MajorityToshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof et al.CCS 2016 · 463 citations
- Function Secret Sharing: Improvements and ExtensionsElette Boyle, Niv Gilboa, Yuval IshaiCCS 2016 · 404 citations
- CryptGPU: Fast Privacy-Preserving Machine Learning on the GPUSijun Tan, Brian Knott, Yuan Tian, David J. WuS&P 2021 · 241 citations
- SiRnn: A Math Library for Secure RNN InferenceDeevashwer Rathee, Mayank Rathee, Rahul Kranti Kiran Goli, Divya Gupta et al.S&P 2021 · 154 citations
Related papers
- TC-Match: Fast Time-constrained Continuous Subgraph MatchingJianye Yang, Sheng Fang, Zhaoquan Gu, Ziyi Ma et al.VLDB 2024 · 7 citations
- A Framework for Privacy Preserving Localized Graph Pattern Query ProcessingLyu Xu, Byron Choi, Yun Peng, Jianliang Xu et al.SIGMOD 2023 · 6 citations
- OblivGNN: Oblivious Inference on Transductive and Inductive Graph Neural NetworkZhibo Xu, Shangqi Lai, Xiaoning Liu, Alsharif Abuadbba et al.USENIX Security 2024 · 13 citations
- Time-Constrained Continuous Subgraph Matching Using Temporal Information for Filtering and BacktrackingSeunghwan Min, Jihoon Jang, Kunsoo Park, Dora Giammarresi et al.ICDE 2024 · 6 citations
- Privacy-preserving Real-time Anomaly Detection Using Edge ComputingShagufta Mehnaz, Elisa BertinoICDE 2020 · 28 citations
