A New Primitive Structure for De-Anonymization Attack in Anonymized Social Networks

International Journal of Computer Trends and Technology (IJCTT)          
© 2015 by IJCTT Journal
Volume-25 Number-2
Year of Publication : 2015
Authors : K.H.Gayathri, B.Venkateswarlu


K.H.Gayathri, B.Venkateswarlu "A New Primitive Structure for De-Anonymization Attack in Anonymized Social Networks". International Journal of Computer Trends and Technology (IJCTT) V25(2):106-109, July 2015. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract -
Computerized follows left by clients of online long range interpersonal communication administrations, even after anonymization, are defenseless to security ruptures. This is exacerbated by the expanding cover in client bases among different administrations. To ready kindred analysts in both the educated community and the business to the achievability of such an assault, we propose a calculation, Seed-and-Grow, to distinguish clients from an anonymized social chart, construct exclusively in light of diagram structure. The calculation first recognizes a seed sub-diagram, either planted by an assailant or revealed by an arrangement of little gathering of clients, and afterward develops the seed bigger taking into account the assailant's current learning of the clients' social relations. Our work recognizes and unwinds understood suspicions taken by past works, dispenses with selfassertive parameters, and enhances distinguishing proof viability and exactness. Reenactments on true gathered datasets check our case.

[1] B. Krishnamurthy and C. E. Wills, ―Characterizing privacy in online social networks, in Proc. ACM WOSN, 2008.
[2] A. Narayanan and V. Shmatikov, ―Deanonymizing social net-works, in Proc.IEEE S&P, 2009.
[3] L. Backstrom, C. Dwork, and J. Kleinberg,―Wherefore art thou r3579x?: anonymized social networks, hidden patterns, and structural steganography, in Proc. ACM WWW, 2007.
[4] M. Hay, G. Miklau, D. Jensen, P. Weis, and S. Srivastava, ―Anonymizing social networks, Univ. Massachusetts, Amherst, Tech. Rep., 2007.
[5] E. Zheleva and L. Getoor, ―Preserving the privacy of sensitive relationships in graph data, in Proc. ACM SIGKDD, 2007. [6] A. Korolova, R. Motwani, S. Nabar, and Y. Xu, ―Link privacy in social networks, in Proc. ACM CIKM, 2008.
[7] B. Zhou and J. Pei, ―Preserving privacy in social networks against neighborhood attacks, in Proc. Intl.Conf.on Data Engineering (ICDE). IEEE, 2008.
[8] M. Hay, G. Miklau, D. Jensen, D. Towsley, and P. Weis, ―Resisting structural reidentification in anonymized social networks, VLDB Endowment, vol. 1, no. 1, pp. 102–114, 2008.
[9] J. Scott, Social network analysis: a handbook. SAGE Publications, 2000.
[10] K. LeFevre, D. DeWitt, and R. Ramakrishnan, ―Incognito: efficient fulldomain k-anonymity, in Proc. ACM ICMD, 2005.
[11] B. Zhou, J. Pei, and W. Luk, ―A brief survey on anonymization techniques for privacy preserving publishing of social network data, ACM SIGKDD Explorations Newsletter, vol. 10, no. 2, pp. 12–22, 2008.
[12] A. Mislove, H. Koppula, K. Gummadi, P. Druschel, and B. Bhat-tacharjee, ―Growth of the flickr social network, in Proc. WOSN.ACM, 2008.
[13] R. Xiang, J. Neville, and M. Rogati, ―Modeling relationship strength in online social networks, in Proc. ACM WWW, 2010.
[14] J. Douceur, ―The sybil attack, LNCS vol. 2429, pp. 251–260, 2002.
[15] N. Tran, B. Min, J. Li, and L. Subramanian, ―Sybil-resilient online content voting, in Proc. USENIX NSDI, 2009.

social networks, anonymity, privacy, attack, graph.