arXiv (All)
open access
Empirical Auditing of Edge-Private Graph Generators
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Data-Free Graph Property Inference Attacks From Graph Embeddings: Data-Free Helps Data-Available#683334
- DiffMI: Breaking Face Recognition Privacy via Diffusion-Driven Training-Free Model Inversion#189259
- Structural Leakage in Graph Encryption: Attacks and Defenses#458234
- Kernel-Complexity Edge Sanitization for Training-Free Defense against Structural Graph Attacks#996526
- Blockchain-anchored multi-discriminator GAN architecture for real-time zero-day attack detection in social IoT edge networks with explainable audit trails#613671
Record · ID 1051648
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive