20Dec 2016

PRIVACY PRESERVING IN SOCIAL NETWORK

  • MIT College of Engineering Department of Information Technology, India.
Crossref Cited-by Linking logo
  • Abstract
  • Keywords
  • References
  • Cite This Article as
  • Corresponding Author

In the real world, a 3rd party companies will publish social networks, e.g., a cloud service supplier , for commerce intellect. An vital point is privacy protecting when declare social system of connection data. The paper shows a rare type of security problem,this termed surroundings violation. We suppose that an raider ability about the intensity of an ambition one-hop bystander, in accession to get community chart, the neighbour relationship target the one-hop bystander the aim and the relationship among these bystanders. Using this information, an attacker may find out the target from a k-anonymous social network with likelihood higher than 1/k where any node’s 1-community chart is isomorphic with k – 1 other node’s chart. To protect the 1*-neighbourhood attack, privacy property key is defined, probability in distinguishability, for an large social network, and Introduce a heuristic in distinguishable group anonymization (HIGA) scheme to produce an anonymous social network with this privacy property. The practical study shows that the anonymous social networks can also be used to answer aggregate queries with high accuracy.


  1. Getoor and C. Diehl, “Link mining: A survey,” ACM SIGKDD Explorations Newsletter, 2005.
  2. Armbrust, A. Fox, R. Griffith, A. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica et al., “A view of cloud computing,” Communications of the ACM, 2010.
  3. Wang, Q. Liu, and J. Wu, “Hierarchical attribute-based encryption for fine-grained access control in cloud storage services,” in Proceedings of ACM CCS, 2010.
  4. Gao, J. Yu, R. Jin, J. Zhou, T. Wang, and D. Yang, “Neighborhoodprivacy protected shortest distance computing in cloud,” in Proc. of ACM COMAD, 2011.
  5. Zhou, J. Pei, and W. Luk, “A brief survey on anonymization techniques for privacy preserving publishing of social network data,”ACM SIGKDD Explorations Newsletter, 2008.
  6. Potterat, L. Phillips-Plummer, S. Muth, R. Rothenberg, D.Woodhouse, T. Maldonado-Long, H. Zimmerman, and J. Muth, “Risk network structure in the early epidemic phase of HIV transmission in Colorado springs,” Sexually Transmitted Infections, 2002.
  7. Zhou and J. Pei, “Preserving privacy in social networks against neighborhood attacks,” in Proc. of IEEE ICDE, 2008.
  8. Page, S. Brin, R. Motwani, and T. Winograd, “The PageRank citation ranking: Bringing order to the web,” Stanford InfoLab, Tech. Rep., 1999.
  9. Diligenti, M. Gori, and M. Maggini, “A unified probabilistic framework for web page scoring systems,” IEEE Transactions on Knowledge and Data Engineering, 2004.
  10. Hay, C. Li, G. Miklau, and D. Jensen, “Accurate estimation of the degree distribution of private networks,” in Proc. of IEEE ICDM, 2009.
  11. Gori, M. Maggini, and L. Sarti, “Exact and approximate graph matching using random walks,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005.
  12. Liu and E. Terzi, “Towards identity anonymization on graphs,” in Proc. of ACM SIGMOD, 2008.

[Harshit Varshney and Nital Adikane. (2016); PRIVACY PRESERVING IN SOCIAL NETWORK Int. J. of Adv. Res. 4 (Dec). 2404-2407] (ISSN 2320-5407). www.journalijar.com


Nital Adikane


DOI:


Article DOI: 10.21474/IJAR01/2665      
DOI URL: http://dx.doi.org/10.21474/IJAR01/2665