The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2014 vol.26)
pp: 635-651
Chih-Hua Tai , National Taipei University, Taipei
Peng-Jui Tseng , National Taiwan University, Taipei
Philip S. Yu , University of Illinois at Chicago, Chicago
Ming-Syan Chen , Academia Sinica, Taipei
ABSTRACT
Social networks model the social activities between individuals, which change as time goes by. In light of useful information from such dynamic networks, there is a continuous demand for privacy-preserving data sharing with analyzers, collaborators or customers. In this paper, we address the privacy risks of identity disclosures in sequential releases of a dynamic network. To prevent privacy breaches, we proposed novel $(k^w)$-structural diversity anonymity, where $(k)$ is an appreciated privacy level and $(w)$ is a time period that an adversary can monitor a victim to collect the attack knowledge. We also present a heuristic algorithm for generating releases satisfying $(k^w)$-structural diversity anonymity so that the adversary cannot utilize his knowledge to reidentify the victim and take advantages. The evaluations on both real and synthetic data sets show that the proposed algorithm can retain much of the characteristics of the networks while confirming the privacy protection.
INDEX TERMS
Privacy, Communities, Heuristic algorithms, Diseases, Data privacy, Educational institutions, Electronic mail,dynamic, Privacy, anonymization, network
CITATION
Chih-Hua Tai, Peng-Jui Tseng, Philip S. Yu, Ming-Syan Chen, "Identity Protection in Sequential Releases of Dynamic Networks", IEEE Transactions on Knowledge & Data Engineering, vol.26, no. 3, pp. 635-651, March 2014, doi:10.1109/TKDE.2013.12
REFERENCES
[1] L. Backstrom, D.P. Huttenlocher, J.M. Kleinberg, and X. Lan, "Group Formation in Large Networks: Membership, Growth, and Evolution," Proc. 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), 2006.
[2] S. Bhagat, B. Krishnamurthy, G. Cormode, and D. Srivastava, "Prediction Promotes Privacy in Dynamic Networks," Proc. Third Conf. Online Social Networks (WOSN), 2010.
[3] J.W. Byun, Y. Sohn, E. Bertino, and N. Li, "Secure Anonymization for Incremental Data Sets," Proc. Third VLDB Int'l Conf. Secure Data Management (SDM), 2006.
[4] J. Cheng, A.W.-C. Fu, and J. Liu, "K-Isomorphism: Privacy Preserving Network Publication against Structural Attacks," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), 2010.
[5] G. Cormode, D. Srivastava, T. Yu, and Q. Zhang, "Anonymizing Bipartite Graph Data Using Safe Groupings," Proc. VLDB Endowment, vol. 1, pp. 833-844, 2008.
[6] S. Fortunato, "Community Detection in Graphs," Physics Report, vol. 486, nos. 3-5, pp. 75-174, 2010.
[7] M. Girvan and M.E.J. Newman, "Community Structure in Social and Biological Networks," Proc. Nat'l Academy Science USA, vol. 99, pp. 7821-7826, 1999.
[8] S. Gregory, "An Algorithm to Find Overlapping Community Structure in Networks," Proc. 11th European Conf. Principles and Practice of Knowledge Discovery in Databases (PKDD), 2007.
[9] M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis, "Resisting Structural Re-Identification in Anonymized Networks," Proc. VLDB Endowment, vol. 1, pp. 102-114, 2008.
[10] G. Karypis and V. Kumar, "A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs," SIAM J. Science Computing, vol. 20, pp. 359-392, 1998.
[11] M.-S. Kim and J. Han, "A Particle-and-Density Based Evolutionary Clustering Method for Dynamic Networks," Proc. VLDB Endowment, vol. 2, pp. 622-633, 2009.
[12] R. Kumar, J. Novak, and A. Tomkins, "Structure and Evolution of Online Networks," Proc. 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), 2006.
[13] A. Lancichinetti and S. Fortunato, "Benchmarks for Testing Community Detection Algorithms on Directed and Weighted Graphs with Overlapping Communities," Physics Rev., vol. 80, no. 1, p. 016118, 2009.
[14] A. Lancichinetti, S. Fortunato, and J. Kertesz, "Detecting the Overlapping and Hierarchical Community Structure in Complex Networks," New J. Physics, vol. 11, p. 033015, 2009.
[15] Y.-R. Lin, Y. Chi, S. Zhu, H. Sundaram, and B.L. Tseng, "FacetNet: A Framework for Analyzing Communities and Their Evolutions in Dynamic Networks," Proc. 17th Int'l Conf. World Wide Web (WWW), pp. 685-694, 2008.
[16] K. Liu and E. Terzi, "Towards Identity Anonymization on Graphs," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), 2008.
[17] A. Machanavajjhala, J. Gehrke, and D. Kifer, "L-Diversity: Privacy Beyond K-Anonymity," Proc. 22nd Int'l Conf. Data Eng. (ICDE), 2006.
[18] N. Medforth and K. Wang, "Privacy Risk In Graph Stream Publishing For Social Network Data," Proc. IEEE 11th Int'l Conf. Data Mining (ICDM), 2011.
[19] L. Sweeney, "K-Anonymity: A Model for Protecting Privacy," Int'l J. Uncertainty, Fuzziness, and Knowledge-Based Systems, vol. 10, pp. 557-570, 2002.
[20] C.-H. Tai, P.S. Yu, D.-N. Yang, and M.-S. Chen, "Structural Diversity for Privacy in Publishing Social Networks," SIAM Int'l Conf. Data Mining (SDM), 2011.
[21] C.-H. Tai, P.S. Yu, D.-N. Yang, and M.-S. Chen, "Privacy-Preserving Social Network Publication against Friendship Attacks," Proc. 17th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), 2011.
[22] L. Tang, H. Liu, J. Zhang, and Z. Nazeri, "Community Evolution in Dynamic Multi-Mode Networks," Proc. 14th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), pp. 677-685, 2008.
[23] J. Tang, M. Musolesi, C. Mascolo, and V. Latora, "Temporal Distance Metrics for Network Analysis," Proc. Second ACM Workshop Online Social Networks (WOSN), 2009.
[24] B. Thompson and D. Yao, "The Union-Split Algorithm and Cluster-Based Anonymization of Social Networks," Proc. Fourth Int'l Symp. Information, Computer, and Comm. Security (ASIACCS), 2009.
[25] K. Wang and B.C.M. Fung, "Anonymizing Sequential Releases," 12th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD), 2006.
[26] X. Wu, X. Ying, K. Liu, and L. Chen, "A Survey of Privacy-Preservation of Graphs and Networks," Managing and Mining Graph Data, vol. 40, pp. 421-453, 2010.
[27] X. Xiao and Y. Tao, "M-Invariance: Towards Privacy Preserving Re-Publication of Dynamic Data Sets," Proc. ACM SIGMOD Int'l Conf. Management of Data (SIGMOD), 2007.
[28] B. Zhou and J. Pei, "Preserving Privacy in Networks Against Neighborhood Attacks," Proc. IEEE 24th Int'l Conf. Data Eng. (ICDE), 2008.
[29] B. Zhou, J. Pei, and W. Luk, "A Brief Survey on Anonymization Techniques for Privacy Preserving Publishing of Network Data," ACM SIGKDD Explorations, vol. 10, pp. 12-22, 2008.
[30] L. Zou, L. Chen, and M.T. Ozsu, "K-Automorphism: A General Framework for Privacy Preserving Network Publication," Proc. VLDB Endowment, vol. 2, pp. 946-957, 2009.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool