Effective and efficient approach for graph de-anonymization

DOI10.13328/J.CNKI.JOS.005436MaRDI QIDQ4688890zbMATH OpenFDO

Authors Jialin Liu, Shuyang Shi, Yuemei Zhang, Yingxia Shao, Bin Cui

Publication date 22 October 2018

Full work available at URL https://doi.org/10.13328/J.CNKI.JOS.005436

zbMATH Keywords

anonymizationde-anonymizationnode similarityprivacy risksocial network

Mathematics Subject Classification ID

Applications of graph theory (05C90) Social networks; opinion dynamics (91D30)

Recommendations

• De-anonymization of heterogeneous random graphs in quasilinear time
• De-anonymization of heterogeneous random graphs in quasilinear time
• Structural attack to anonymous graph of social networks
• Triangle randomization for social network data anonymization
• Efficient algorithm on anonymizing social networks with reachability preservation

Cited in

(5)

• De-anonymization of heterogeneous random graphs in quasilinear time
• De-anonymization of heterogeneous random graphs in quasilinear time
• A schema-independent user identification algorithm in social networks
• Structural attack to anonymous graph of social networks
• Active Re-identification Attacks on Periodically Released Dynamic Social Graphs

This page was built for publication: Effective and efficient approach for graph de-anonymization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4688890)