Abstract
The problem of hiding a node inside of a network in the presence of an unauthorized crawler has been shown to be NP-complete. The available heuristics tackle this problem from mainly two perspectives: (1) the local immediate neighborhood of the target node (local perturbation models) and (2) the global structure of the graph (global perturbation models). While the objective of both is similar (i.e., decreasing the centrality of the target node), they vary substantially in their performance and efficiency; the global measures are computationally inefficient in the real-world scenarios, while the local perturbation methods deal with the problem of constrained performance. In this study, we propose a community-based heuristic, CoVerD, that retains both the computational efficiency of local methods and the superior performance of global methods in minimizing the target’s closeness centrality. Our experiments on five real-world networks show a significant increase in performance by using CoVerD against both BFS and DFS crawling attacks. In some instances, our algorithm successfully increased the crawler’s budget by 3 and 10 times compared to the next best-performing benchmark. The results of this study show the importance of the local community structure in preserving the privacy of the nodes in a network, and pave a promising path for designing scalable and effective network protection models.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
‘Community’ here refers to a topological community.
- 2.
- 3.
For our largest dataset, github, obtaining the results of the global measures was infeasible.
References
Abrahamsson, O.: Hide and seek in a social network. Master’s thesis, Linköping University, Sweden (2017)
Areekijseree, K., Laishram, R., Soundarajan, S.: Max-node sampling: an expansion-densification algorithm for data collection. In: IEEE International Conference on Big Data (2016)
Areekijseree, K., Laishram, R., Soundarajan, S.: Guidelines for online network crawling: a study of data collection approaches and network properties. In: Proceedings of the 10th ACM Conference on Web Science (2018)
Avram, M.V., Mishra, S., Parulian, N.N., Diesner, J.: Adversarial perturbations to manipulate the perception of power and influence in networks. In: 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM). IEEE (2019)
Bai, Q., Xiong, G., Zhao, Y., He, L.: Analysis and detection of bogus behavior in web crawler measurement. Proc. Comput. Sci. 31, 1084–1091 (2014)
Bisenius, P., Bergamin, E., Angriman, E., Meyerhenke, H.: Computing top-k closeness centrality in fully-dynamic graphs. In: 2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM (2018)
Blondel, V.D., Guillaume, J.L., Lambiotte, R., Lefebvre, E.: Fast unfolding of communities in large networks. J. Stat. Mech: Theory Exp. 2008(10), P10008 (2008)
Borassi, M., Crescenzi, P., Marino, A.: Fast and simple computation of top-k closeness centralities. arXiv preprint arXiv:1507.01490 (2015)
Crescenzi, P., D’Angelo, G., Severini, L., Velaj, Y.: Greedily improving our own centrality in a network. In: Bampis, E. (ed.) SEA 2015. LNCS, vol. 9125, pp. 43–55. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-20086-6_4
Dougnon, R.Y., Fournier-Viger, P., Nkambou, R.: Inferring user profiles in online social networks using a partial social graph. In: Barbosa, D., Milios, E. (eds.) CANADIAN AI 2015. LNCS (LNAI), vol. 9091, pp. 84–99. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-18356-5_8
Fortunato, S.: Community detection in graphs. Phys. Rep. 486(3–5), 75–174 (2010)
Gupta, N., Singh, A., Cherifi, H.: Community-based immunization strategies for epidemic control. In: 2015 7th International Conference on Communication Systems and Networks (COMSNETS). IEEE (2015)
Hozhabrierdi, P., Zhu, R., Onyewu, M., Soundarajan, S.: Network-based analysis of early pandemic mitigation strategies: solutions, and future directions. Northeast J. Complex Syst. (NEJCS) 3(1), 3 (2021)
Ji, J., Wu, G., Duan, C., Ren, Y., Wang, Z.: Greedily remove k links to hide important individuals in social network. In: Meng, W., Furnell, S. (eds.) SocialSec 2019. CCIS, vol. 1095, pp. 223–237. Springer, Singapore (2019). https://doi.org/10.1007/978-981-15-0758-8_17
Kumar, M., Bhatia, R., Rattan, D.: A survey of web crawlers for information retrieval. Wiley Interdisc. Rev.: Data Min. Knowl. Discov. 7(6), e1218 (2017)
Laishram, R., Hozhabrierdi, P., Wendt, J., Soundarajan, S.: NetProtect: network perturbations to protect nodes against entry-point attack. In: 13th ACM Web Science Conference 2021 (2021)
Mondal, M., et al.: Defending against large-scale crawls in online social networks. In: Proceedings of the 8th International Conference on Emerging Networking Experiments and Technologies (2012)
Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: IEEE Symposium on Security and Privacy. IEEE (2009)
Okamoto, K., Chen, W., Li, X.-Y.: Ranking of closeness centrality for large-scale social networks. In: Preparata, F.P., Wu, X., Yin, J. (eds.) FAW 2008. LNCS, vol. 5059, pp. 186–195. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-69311-6_21
Olsen, P.W., Labouseur, A.G., Hwang, J.H.: Efficient top-k closeness centrality search. In: 2014 IEEE 30th International Conference on Data Engineering. IEEE (2014)
Rüdian, S., Pinkwart, N., Liu, Z.: I know who you are: deanonymization using Facebook likes. In: Workshops der INFORMATIK 2018-Architekturen, Prozesse, Sicherheit und Nachhaltigkeit. Köllen Druck+ Verlag GmbH (2018)
Schlicher, B.G., MacIntyre, L.P., Abercrombie, R.K.: Towards reducing the data exfiltration surface for the insider threat. In: 2016 49th Hawaii International Conference on System Sciences (HICSS). IEEE (2016)
Shang, Y.: False positive and false negative effects on network attacks. J. Stat. Phys. 170(1), 141–164 (2018)
Wang, M., Tan, Q., Wang, X., Shi, J.: De-anonymizing social networks user via profile similarity. In: 2018 IEEE Third International Conference on Data Science in Cyberspace (DSC). IEEE (2018)
Waniek, M., Michalak, T.P., Wooldridge, M.J., Rahwan, T.: Hiding individuals and communities in a social network. Nat. Hum. Behav. 2(2), 139–147 (2018)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Hozhabrierdi, P., Soundarajan, S. (2022). CoVerD: Community-Based Vertex Defense Against Crawling Adversaries. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds) Complex Networks & Their Applications X. COMPLEX NETWORKS 2021. Studies in Computational Intelligence, vol 1072. Springer, Cham. https://doi.org/10.1007/978-3-030-93409-5_30
Download citation
DOI: https://doi.org/10.1007/978-3-030-93409-5_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-93408-8
Online ISBN: 978-3-030-93409-5
eBook Packages: EngineeringEngineering (R0)