Abstract
Surveillance is a critical measure to break anonymity. While surveillance with unlimited resources is often assumed as a means, against which, to design stronger anonymity algorithms, this paper addresses the general impact of limited resource on surveillance efficiency. The general impact of limited resource on identifying a hidden group is experimentally studied; the task of identification is only done by following communications between suspects, i.e., the information of whos talking to whom. The surveillance uses simple but intuitive algorithms to return more intelligence with limited resource. The surveillance subject used in this work is the publicly available Enron email data set, an actual trace of human interaction. The initial expectation was that, even with limited resource, intuitive surveillance algorithms would return the higher intelligence than a random approach by exploiting the general properties of power law-style communication map. To the contrary, the impact of limited resource was found large to the extent that intuitive algorithms do not return significantly higher intelligence than a random approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akoglu, L., McGlohon, M., Faloutsos, C.: Anomaly detection in large graphs. In: CMU-CS-09-173 Technical report (2009)
Bansod, N., Malgi, A., Choi, B.K., Mayo, J.: Muon: epidemic based mutual anonymity in unstructured p2p networks. Comput. Netw. 52(5), 915–934 (2008)
Berthold, O., Federrath, H., Köpsell, S.: Web mixes: a system for anonymous and unobservable internet access. In: Workshop on Design Issues in Anonymity and Unobservability, pp. 115–129 (2000)
Chapanond, A., Krishnamoorthy, M.S., Yener, B.: Graph theoretic and spectral analysis of enron email data. Comput. Math. Organ. Theor. 11(3), 265–281 (2005)
CMU. Enron email dataset. http://www.cs.cmu.edu/enron
F. E. R. Commission. Enron investigation. http://www.ferc.gov/industries/electric/indus-act/wec/enron/info-release.asp
Danezis, G., Wittneben, B.: The economics of mass surveillance and the questionable value of anonymous communications. In: Anderson, R., (eds.) Proceedings of the Fifth Workshop on the Economics of Information Security (WEIS 2006), Cambridge, UK, June 2006
Diesner, J., Frantz, T.L., Carley, K.M.: Communication networks from the enron email corpus “it’s always about the people. Enron is no different”. Comput. Math. Organ. Theor. 11(3), 201–228 (2005)
Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Onion routing. Commun. ACM 42(2), 39–41 (1999)
ISI. Enron dataset. http://www.isi.edu/adibi/Enron/Enron.htm
Keila, P.S., Skillicorn, D.B.: Structure in the enron email dataset. Comput. Math. Organ. Theor. 11(3), 183–199 (2005)
NarusInsight. Narusinsight solutions for traffic intelligence. http://www.narus.com/index.php/product
Sherwood, R., Bhattacharjee, B., Srinivasan, A.: P\(^{\text{5 }}\): a protocol for scalable anonymous communication. J. Comput. Secur. 13(6), 839–876 (2005)
Shetty, J., Adibi, J.: The enron email dataset database schema and brief statistical report (2004)
Shetty, J., Adibi, J.: Discovering important nodes through graph entropy the case of enron email database. In: Proceedings of the 3rd International Workshop on Link Discovery, LinkKDD ’05, pp. 74–81, ACM, New York (2005)
Shields, C., Levine, B.N.: A protocol for anonymous communication over the internet. In: ACM Conference on Computer and Communications Security, pp. 33–42 (2000)
Ventura, H.E., Miller, J.M., Deflem, M.: Governmentality and the war on terror: Fbi project carnivore and the diffusion of disciplinary power. Crit. Criminol. 13, 55–70 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Do, H., Choi, P., Lee, H. (2014). Dynamic Surveillance: A Case Study with Enron Email Data Set. In: Kim, Y., Lee, H., Perrig, A. (eds) Information Security Applications. WISA 2013. Lecture Notes in Computer Science(), vol 8267. Springer, Cham. https://doi.org/10.1007/978-3-319-05149-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-05149-9_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-05148-2
Online ISBN: 978-3-319-05149-9
eBook Packages: Computer ScienceComputer Science (R0)