Privacy-Preserving Analytics on Decentralized Social Graphs: The Case of Eigendecomposition
Songlei Wang, Yifeng Zheng, Xiaohua Jia, Xun Yi

TL;DR
This paper introduces PrivGED, a system for privacy-preserving eigendecomposition of decentralized social graphs, enabling secure, accurate, and efficient graph analytics without compromising user privacy.
Contribution
PrivGED is the first system combining lightweight cryptography and differential privacy for secure eigendecomposition over decentralized social graphs.
Findings
Achieves accuracy comparable to plaintext analysis
Provides strong privacy protection for user data
Demonstrates practical performance on real-world datasets
Abstract
Analytics over social graphs allows to extract valuable knowledge and insights for many fields like community detection, fraud detection, and interest mining. In practice, decentralized social graphs frequently arise, where the social graph is not available to a single entity and is decentralized among a large number of users, each holding only a limited local view about the whole graph. Collecting the local views for analytics of decentralized social graphs raises critical privacy concerns, as they encode private information about the social interactions among individuals. In this paper, we design, implement, and evaluate PrivGED, a new system aimed at privacy-preserving analytics over decentralized social graphs. PrivGED focuses on the support for eigendecomposition, one popular and fundamental graph analytics task producing eigenvalues/eigenvectors over the adjacency matrix of a…
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 · Random Matrices and Applications
