On analyzing and evaluating privacy measures for social networks under active attack
arXiv:1809.05926 · doi:10.1016/j.ins.2018.09.023
Abstract
Widespread usage of complex interconnected social networks such as Facebook, Twitter and LinkedIn in modern internet era has also unfortunately opened the door for privacy violation of users of such networks by malicious entities. In this article we investigate, both theoretically and empirically, privacy violation measures of large networks under active attacks that was recently introduced in (Information Sciences, 328, 403-417, 2016). Our theoretical result indicates that the network manager responsible for prevention of privacy violation must be very careful in designing the network if its topology does not contain a cycle. Our empirical results shed light on privacy violation properties of eight real social networks as well as a large number of synthetic networks generated by both the classical Erdos-Renyi model and the scale-free random networks generated by the Barabasi-Albert preferential-attachment model.
arXiv commentTo appear in Information Sciences
References in corpus (15)
- Emergence of scaling in random networks
- Statistical mechanics of complex networks
- The structure and function of complex networks
- Cooperative Game Theory Approaches for Network Partitioning
- Who is the best connected scientist? A study of scientific coauthorship networks
- Network robustness and fragility: Percolation on random graphs
- Attack vulnerability of complex networks
- Self-similar community structure in organisations
- Community Structure in Jazz
- Resilience to Contagion in Financial Networks
- Privacy-preserving Machine Learning through Data Obfuscation
- Topological implications of negative curvature for biological and social networks
- Computing the diameter polynomially faster than APSP
- On optimal approximability results for computing the strong metric dimension
- On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack