Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

ANNM: A New Method for Adding Noise Nodes Which are Used Recently in Anonymization Methods in Social Networks

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

One of the main concerns at the time of production or share of information on social networking sites for scientific research and business analysis is privacy. Recently, different models of privacy such as k-anonymity have been created by researchers to avoid detection by using structural information. But still, attackers may be able to access private information by observing the behavior of some nodes in social networks. Current approaches that mainly focus on creating anonymity by edge editing or clustering may significantly change the properties of the social network graph. According to studies of Yuan et al. (IEEE Trans Knowl Data Eng 25(3):633–647, 2013), that makes anonymity with adding noise nodes, we decided to present a new method for adding noise nodes with least changes in main graph attributes. We used betweenness centrality measurement to prioritize the creation of noise nodes and considered the amount of their impact on graph properties. The result of comparing our proposed solution and other related works shows that the structural properties of the original social network graph have had very little change.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16

Similar content being viewed by others

Notes

  1. KDLD: Yuan et al. [1].

  2. Alpha-anonymization: Chakraborty and Tripathy [13].

References

  1. Yuan, M., Chen, L., Philip, S. Y., & Yu, T. (2013). Protecting sensitive labels in social network data anonymization. IEEE Transactions on Knowledge and Data Engineering, 25(3), 633–647.

    Article  Google Scholar 

  2. Abawajy, J., Ninggal, H., & Herawan, T. (2016). Privacy preserving social network data publication. IEEE Transactions Communications Surveys & Tutorials, 18(3), 1974–1997.

    Article  Google Scholar 

  3. Qian, J., Li, X., Zhang, C. H., Chen, L., Jung, T., & Han, J. (2017). Social network de-anonymization and privacy inference with knowledge graph model. IEEE Transactions on Dependable and Secure Computing, 1–14. https://doi.org/10.1109/TDSC.2017.2697854.

  4. Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, D. (2008). Resisting structural re-identification in anonymized social networks. Proceedings of the VLDB Endowment, 1(1), 102–114.

    Article  Google Scholar 

  5. Zhou, B., & Pei, J. (2008). Preserving privacy in social networks against neighborhood attacks. In Proc. IEEE 24th Int’l Conf, 2008. data eng. (ICDE’08) (pp. 506–515).

  6. Zhou, B., & Pei, J. (2011). The K-anonymity and L-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowledge and Information Systems, 28, 47–77.

    Article  Google Scholar 

  7. Zou, L., Chen, L., & Özsu, M. T. (2009). K-automorphism: A general framework for privacy preserving network publication. Proceedings of the VLDB Endowment, 2, 946–957.

    Article  Google Scholar 

  8. Sweeney, L. (2002). K-anonymity: A model for protecting privacy. International Journal of Uncertainty Fuzziness Knowledge-Based Systems, 10, 557–570.

    Article  MathSciNet  MATH  Google Scholar 

  9. Campan, A. & Truta, T. M. (2008). A clustering approach for data and structural anonymity in social networks. In Proc. second ACM SIGKDD Int’l workshop privacy, security, and trust in KDD, in conjunction with KDD.

  10. Thompson, B. & Yao, D. (2009) The union-split algorithm and cluster-based anonymization of social networks. In ASIACCS’09: Proc. fourth Int’l symp, 2009. Information, computer, and comm. security (pp. 218–227).

  11. He, X., Vaidya, J., Shafiq, B., Adam, N., & Atluri, V. (2009) Preserving privacy in social networks: A structure-aware approach. In WIIAT’09: Proc. IEEE/WIC/ACM Int’l joint conf, 2009. Web intelligence and intelligent agent technology (Vol. 1, pp. 647–654).

  12. Masoumzadeh, A., & Joshi, J. (2012). Preserving structural properties in edge-perturbing anonymization techniques for social networks. IEEE Transactions on Dependable and Secure Computing, 9(6), 877–889.

    Article  Google Scholar 

  13. Chakraborty, S., & Tripathy, B. K. (2016). Alpha-anonymization techniques for privacy preservation in social networks. Social Network Analysis and Mining, 6(29), 1–11.

    Google Scholar 

  14. Ying, X., Pan, K., Wu, X. & Guo, L. (2009). Comparisons of randomization and K-degree anonymization schemes for privacy preserving social network publishing. In SNA-KDD’09: Proc, 2009. Third workshop social network mining and analysis (pp. 1–10).

  15. Freeman, L. C. (1977). A set of measures of centrality based on betweenness. Sociometry, 40, 35–41.

    Article  Google Scholar 

  16. Bavelas, A. (1950). Communication patterns in task-oriented groups. The Journal of the Acoustical Society of America, 22(6), 725–730.

    Article  Google Scholar 

  17. Sabidussi, G. (1966). The centrality index of a graph. Psychometrika, 31, 581–603.

    Article  MathSciNet  MATH  Google Scholar 

  18. Liu, K., & Terzi, E. (2008). Towards identity anonymization on graphs. IN SIGMOD’08: Proc. ACM SIGMOD Int’l conf, 2008. Management of data (pp. 93–106).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering and Information Technology, Imam Reza International University, Mashhad, Islamic Republic of Iran

    Seyedhashem Hamzehzadeh & Sayyed Majid Mazinani

Authors
  1. Seyedhashem Hamzehzadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sayyed Majid Mazinani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sayyed Majid Mazinani.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Hamzehzadeh, S., Mazinani, S.M. ANNM: A New Method for Adding Noise Nodes Which are Used Recently in Anonymization Methods in Social Networks. Wireless Pers Commun 107, 1995–2017 (2019). https://doi.org/10.1007/s11277-019-06370-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-019-06370-6

Keywords

Search

Navigation