No article text was recorded for this version.
structural indistinguishability (k-degree anonymity)
Version 1 of 125 papers44 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Privacy-Preserved Network Data Publishing
- Blog: k-Anonymization of Social Networks by Vertex Addition
- Blog: Privacy Preserving Social Network Publication Against Mutual Friend Attacks
- Blog: Preventing active re-identification attacks on social graphs via sybil subgraph obfuscation
- Blog: K-Automorphism: A General Framework For Privacy Preserving Network Publication
- Blog: Anonymising social graphs in the presence of active attackers
- Blog: You Can't See Me: Anonymizing Graphs Using the Szemerédi Regularity Lemma
- Blog: A Review of Anonymization for Healthcare Data
- Blog: Anonymizing bipartite graph data using safe groupings
- Blog: Evading Overlapping Community Detection via Proxy Node Injection
- Blog: A Privacy Preservation Method for Attributed Social Network Based on Negative Representation of Information
- Blog: Personalized Privacy Protection in Social Networks
- Blog: Preserving structural properties in anonymization of social networks
- Blog: Privacy Preserving Social Network Publication Against Mutual Friend Attacks
- Blog: Conditional adjacency anonymity in social graphs under active attacks
- Blog: FedSkeleton: Secure Multi-Party Graph Skeleton Construction for Privacy-Preserving Federated Time-Series Forecasting
- Blog: Privacy in Social Networks
- Blog: Editorial: Deep Mining Big Social Data
- Blog: Structural Diversity for Resisting Community Identification in Published Social Networks
- Blog: Privacy-Preserving Graph Machine Learning from Data to Computation: A Survey
- Blog: On the Complexity of Sampling Vertices Uniformly from a Graph
- Blog: k-Anonymous Decision Tree Induction
- Blog: Foreword for the special issue of selected papers from the 7th EDBT/ICDT Workshop on Privacy and Anonymity in Information Society (PAIS 2014)
- Blog: Robust active attacks on social graphs
- Blog: Recommendations for sharing network data and materials
History & citation
Current · Permanent link
- This direction split from structural re-identification (68% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_structural_indistinguishability_k_degree_8e77088a,
title = {structural indistinguishability (k-degree anonymity)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/structural-indistinguishability-k-degree-anonymity/rdr_8e77088afebc464f9e0083b36a9379c9},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-22},
}This exact version (version 1, frozen text):
@misc{lacuna_structural_indistinguishability_k_degree_8e77088a_v1,
title = {structural indistinguishability (k-degree anonymity)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/structural-indistinguishability-k-degree-anonymity/rdr_8e77088afebc464f9e0083b36a9379c9/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-22},
}