Abstract
The explosion of social networks is pervading every form of business. When used inside corporate networks, they can create potential vulnerabilities as employees at the lower levels in the organization chart may become influential thanks to social connections. This unexpected influence could be dangerous if the employee behaves maliciously reducing thus the trustworthiness of the overall organization. The paper is a first attempt in understanding this phenomenon by proposing a model for corporate networks that is able to measure the influence of each employee on the overall organizational chart, that is, to which extent an employee is able to spread (mis)information through the corporate network. The evaluation is done considering the Enron case.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avizienis, A., Laprie, J.C., Randell, B., Landwehr, C.: Basic concepts and taxonomy of dependable and secure computing. IEEE Transactions on Dependable and Secure Computing 1(1), 11–33 (2004)
IBM: Smallblue research tool, http://smallblue.research.ibm.com/
Budak, C., Agrawal, D., El Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, WWW 2011, pp. 665–674 (2011)
http://www.isi.edu/~adibi/Enron/Enron.html (access: February 20, 2013)
Domingos, P., Richardson, M.: Mining the network value of customers. In: Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2001, pp. 57–66 (2001)
Kempe, D., Kleinberg, J., Tardos, E.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 137–146 (2003)
Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 306–311. Springer, Heidelberg (2007)
Luo, Z.-L., Cai, W.-D., Li, Y.-J., Peng, D.: A pageRank-based heuristic algorithm for influence maximization in the social network. In: Gaol, F.L. (ed.) Recent Progress in DEIT, Vol. 2. LNEE, vol. 157, pp. 485–490. Springer, Heidelberg (2012)
Chen, W., Wang, C., Wang, Y.: Scalable influence maximization for prevalent viral marketing in large-scale social networks. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2010, pp. 1029–1038. ACM, New York (2010)
Kermarrec, A.M., Van Steen, M.: Gossiping in distributed systems. ACM SIGOPS Operating Systems Review 41(5), 2–7 (2007)
Eugster, P.T., Guerraoui, R., Handurukande, S.B., Kouznetsov, P., Kermarrec, A.M.: Lightweight probabilistic broadcast. ACM TOCS 21(4), 341–374 (2003)
http://www.isi.edu/~adibi/Enron/Enron_Employee_Status.xls (access: February 20, 2013)
http://news.findlaw.com/hdocs/docs/enron/enronbk72803app-c.pdf (access: February 20, 2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baldoni, R., Bonomi, S., Di Luna, G.A., Montanari, L., Sorella, M. (2013). Understanding (Mis)Information Spreading for Improving Corporate Network Trustworthiness. In: Vieira, M., Cunha, J.C. (eds) Dependable Computing. EWDC 2013. Lecture Notes in Computer Science, vol 7869. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38789-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-38789-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38788-3
Online ISBN: 978-3-642-38789-0
eBook Packages: Computer ScienceComputer Science (R0)