Counterterrorism: Privately Clustering a Radical Social Network Data

The tradeoff between the needed or essential gathering and analysis of personal data and the privacy rights of individuals is now an important requirement under any counterterrorism program. The most famous and controversial recent example is the revelation that US intelligence agencies systemically engage in “bulk collection” of civilian “metadata” detailing telephonic and other types of communication and activities, with the alleged purpose of monitoring and thwarting terrorist activity. Differential privacy provides one of the strongest privacy guarantees up to now. In this paper, we present a new provably privacy-preserving algorithm able to identify and take action upon members of the targeted subpopulation. Meanwhile, avoiding compromising the privacy of the patriot subpopulation. It is a new algorithm for search methods which use a new combination of nodes social similarity and differential privacy.

[1]  S. P. Ghrera,et al.  Nearest Neighbor search in Complex Network for Community Detection , 2015, ArXiv.

[2]  Kobbi Nissim,et al.  Locating a Small Cluster Privately , 2016, PODS.

[3]  Aaron Roth,et al.  The Algorithmic Foundations of Differential Privacy , 2014, Found. Trends Theor. Comput. Sci..

[4]  Chong Wu,et al.  A new network node similarity measure method and its applications , 2014, ArXiv.

[5]  Liang Zhou,et al.  The detection and quantification of retinopathy using digital angiograms , 1994, IEEE Trans. Medical Imaging.

[6]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[7]  Quan Geng,et al.  The Optimal Mechanism in $(\epsilon,\delta)$-Differential Privacy , 2013 .

[8]  L. Takac.  DATA ANALYSIS IN PUBLIC SOCIAL NETWORKS , 2012 .

[9]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, KDD 2012.

[10]  Cynthia Dwork,et al.  Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.

[11]  Pramod Viswanath,et al.  The Composition Theorem for Differential Privacy , 2013, IEEE Transactions on Information Theory.

[12]  Ting Yu,et al.  A Privacy-Preserving Framework for Personalized, Social Recommendations , 2014, EDBT.

[13]  Ljupco Kocarev,et al.  Identifying communities by influence dynamics in social networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[15]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[16]  Ninghui Li,et al.  Publishing Graph Degree Distribution with Node Differential Privacy , 2016, SIGMOD Conference.

[17]  Zhiwei Steven Wu,et al.  Private algorithms for the protected in social network search , 2016, Proceedings of the National Academy of Sciences.

[18]  Andreas Haeberlen,et al.  Differential Privacy: An Economic Method for Choosing Epsilon , 2014, 2014 IEEE 27th Computer Security Foundations Symposium.