Empirical Auditing of Edge-Private Graph Generators

📅 2026-09-21
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
本文通过统计验证攻击方法,审计了图生成器的隐私泄露问题,比较了不同攻击方式在目标边周围几何结构上的效果。
📝 Abstract
We empirically audit privacy leakage by testing whether outputs from edge-neighbouring inputs remain distinguishable, using statistically valid lower bounds on the privacy loss witnessed by our attacks. Our framework compares direct-edge, local-structural, and GNN-based attacks through the geometry surrounding a target edge. Experiments across two generators and two networks show that privacy leakage is both mechanism- and network-dependent, with learned representations revealing information not captured by conventional local statistics.
Problem

Research questions and friction points this paper is trying to address.

privacy leakage
edge-neighbouring inputs
graph generators
Innovation

Methods, ideas, or system contributions that make the work stand out.

edge-private graph generators
privacy leakage auditing
statistically valid lower bounds
GNN-based attacks
🔎 Similar Papers
No similar papers found.