MAGO : Maliciously Secure Subgraph Counting on Decentralized Social Graphs

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

View graph of relations



Original languageEnglish
Pages (from-to)2929-2944
Journal / PublicationIEEE Transactions on Information Forensics and Security
Online published1 May 2023
Publication statusPublished - 2023


Subgraph counting aims to count over a large graph subgraphs matching a given shape (e.g., triangle), which plays an important role in various social graph analytics applications such as discovering social roles and characterizing social networks. Subgraph counting over social graphs, however, becomes quite challenging when the social graph to be analyzed is presented in a decentralized manner, where each user only holds a local view. Collecting the local views for subgraph counting-based analytics raises acute privacy concerns, because they capture the sensitive social relationships among individuals. In light of this, we design, implement, and evaluate MAGO, a new system aimed at maliciously secure subgraph counting on decentralized social graphs. MAGO is built from a delicate synergy of insights on graph analytics, lightweight cryptography, and local differential privacy, allowing individual users to securely contribute their local views on a decentralized social graph for a cloud-empowered subgraph counting service. In addition to the protection for data confidentiality, MAGO is also designed to protect against a malicious adversary that might try to tamper with the subgraph counting results. Extensive experiments over real-world social graph datasets demonstrate the practically affordable performance of MAGO for maliciously secure subgraph counting. © 2023 IEEE.

Research Area(s)

  • cloud computing, Decentralized social graph analytics, privacy preservation, security