Triangle randomization for social network data anonymization
From MaRDI portal
Recommendations
- KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm
- A personalized privacy preserving method for publishing social network data
- A differentiated anonymity algorithm for social network privacy preservation
- k-anonymous path privacy on social graphs
- Structural attack to anonymous graph of social networks
Cited in
(13)- Effective and efficient approach for graph de-anonymization
- A brief survey on the contribution of Mirka Miller to the security of statistical databases
- Eulogy for Professor Mirka Miller (1949--2016)
- A personalized privacy preserving method for publishing social network data
- De-anonymization of heterogeneous random graphs in quasilinear time
- k-anonymous path privacy on social graphs
- Structural attack to anonymous graph of social networks
- A GrC-Based Approach to Social Network Data Protection
- Active Re-identification Attacks on Periodically Released Dynamic Social Graphs
- CoVerD: community-based vertex defense against crawling adversaries
- Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller
- A differentiated anonymity algorithm for social network privacy preservation
- Quantifying privacy: a novel entropy-based measure of disclosure risk
This page was built for publication: Triangle randomization for social network data anonymization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2940098)
