Skip to main content
SpringerLink
Log in

A survey of graph-modification techniques for privacy-preserving on networks

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

Recently, a huge amount of social networks have been made publicly available. In parallel, several definitions and methods have been proposed to protect users’ privacy when publicly releasing these data. Some of them were picked out from relational dataset anonymization techniques, which are riper than network anonymization techniques. In this paper we summarize privacy-preserving techniques, focusing on graph-modification methods which alter graph’s structure and release the entire anonymous network. These methods allow researchers and third-parties to apply all graph-mining processes on anonymous data, from local to global knowledge extraction.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

References

  • Assam R, Hassani M, Brysch M, Seidl T (2014) (\(k\),\(d\))-core anonymity: structural anonymization of massive networks. In: Proceedings of the 26th international conference on scientific and statistical database management (SSDBM ’14), vol 17, pp 1–17:12, Aalborg, Denmark, ACM

  • Backstrom L, Dwork C, Kleinberg J (2007) Wherefore art thou r3579x? Anonymized social networks, hidden patterns, and structural steganography. In: International conference on World Wide Web (WWW), WWW ’07, ACM Press, New York, NY, USA, pp 181–190

  • Bhagat S, Cormode G, Krishnamurthy B, Srivastava D (2009) Class-based graph anonymization for social network data. Proc VLDB Endow 2(1):766–777

    Article  Google Scholar 

  • Boldi P, Bonchi F, Gionis A, Tassa T (2012) Injecting uncertainty in graphs for identity obfuscation. Proc VLDB Endow 5(11):1376–1387

    Article  Google Scholar 

  • Bonchi F, Gionis A, Tassa T (2011) Identity obfuscation in graphs through the information theoretic lens. In: 2011 IEEE 27th international conference on data engineering, Washington, DC, USA, IEEE Computer Society, pp 924–935

  • Bonchi F, Gionis A, Tassa T (2014) Identity obfuscation in graphs through the information theoretic lens. Inf Sci 275:232–256

    Article  MathSciNet  Google Scholar 

  • Bredereck R, Froese V, Hartung S, Nichterlein A, Niedermeier R, Talmon N (2014) The complexity of degree anonymization by vertex addition. In: Proceedings of the 10th international conference on algorithmic aspects in information and management (AAIM ’14), Vancouver, BC, Canada, pp 44–55

  • Campan A, Truta TM (2008) A clustering approach for data and structural anonymity in social networks. In: ACM SIGKDD international workshop on privacy, security, and trust (PinKDD), Las Vegas, Nevada, USA, ACM, pp 1–10

  • Campan A, Truta TM (2009) Data and structural \(k\)-anonymity in social networks. In: Privacy, security, and trust in KDD (PinKDD), Springer, pp 33–54

  • Campan A, Alufaisan Y, Truta TM (2015) Preserving communities in anonymized social networks. Trans Data Priv (TDP) 8(1):55–87

    Google Scholar 

  • Casas-Roma J (2014) Privacy-preserving on graphs using randomization and edge-relevance. In: Vicenç T (ed) International conference on modeling decisions for artificial intelligence (MDAI), Tokyo, Japan, Springer International Publishing, Switzerland, pp 204–216

  • Casas-Roma J, Herrera-Joancomartí J, Torra V (2013) An algorithm for \(k\)-degree anonymity on large networks. In: IEEE international conference on advances on social networks analysis and mining (ASONAM), Niagara Falls, CA, IEEE Computer Society, pp 671–675

  • Casas-Roma J, Herrera-Joancomartí J, Torra V (2016) \(k\)-Degree anonymity and edge selection: improving data utility in large networks. Knowledge and Information Systems (KAIS), pp 1–28. doi:10.1007/s10115-016-0947-7

  • Chester S, Srivastava G (2011) Social network privacy for attribute disclosure attacks. In: 2011 international conference on advances in social networks analysis and mining (ASONAM), Kaohsiung, IEEE, pp 445–449

  • Chester S, Kapron BM, Ramesh G, Srivastava G, Thomo A, Venkatesh S (2011) \(k\)-Anonymization of social networks by vertex addition. In: ADBIS 2011 research communications, Vienna, Austria, pp 107–116. http://www.CEUR-WS.org

  • Chester S, Gaertner J, Stege U, Venkatesh S (2012) Anonymizing subsets of social networks with degree constrained subgraphs. In: IEEE international conference on advances on social networks analysis and mining (ASONAM), Washington, DC, USA, IEEE Computer Society, pp 418–422

  • Chester S, Kapron BM, Ramesh G, Srivastava G, Thomo A, Venkatesh S (2013a) Why Waldo befriended the dummy? k-Anonymization of social networks with pseudo-nodes. Soc Netw Anal Min 3(3):381–399

    Article  Google Scholar 

  • Chester S, Kapron BM, Srivastava G, Venkatesh S (2013b) Complexity of social network anonymization. Soc Netw Anal Min 3(2):151–166

    Article  Google Scholar 

  • Cormode G, Srivastava D, Ting Y, Zhang Q (2010) Anonymizing bipartite graph data using safe groupings. Proc VLDB Endow 19(1):115–139

    Google Scholar 

  • D’Acquisto G, Domingo-Ferrer J, Kikiras P, Torra V, de Montjoye Y-A, Bourka A (2015) Privacy by design in big data: an overview of privacy enhancing technologies in the era of big data analytics, technical report. The European Union Agency for Network and Information Security (ENISA)

  • Das S, Egecioglu Ö, El Abbadi A (2010) Anonymizing weighted social network graphs. In: IEEE international conference on data engineering (ICDE). IEEE Computer Society, pp 904–907

  • De Capitani di Vimercati S, Foresti S, Livraga G, Samarati P (2012) Data privacy: definitions and techniques. Int J Uncertain Fuzziness Knowl Based Syst (IJUFKS) 20(6):793–818

    Article  MATH  Google Scholar 

  • Dwork C (2006) Differential privacy. In Bugliesi M, Preneel P, Sassone V, Wegener I (eds) International conference on automata, languages and programming (ICALP), volume 4052 of Lecture notes in computer science. Heidelberg, Springer, Berlin, pp 1–12

  • Feder T, Nabar SU, Terzi E (2008) Anonymizing graphs. CoRR abs/0810.5: 1–15

  • Ferri F, Grifoni P, Guzzo T (2011) New forms of social and professional digital relationships: the case of Facebook. Soc Netw Anal Min (SNAM) 2(2):121–137

    Article  Google Scholar 

  • Ford R, Truta TM, Campan A (2009) \(P\)-Sensitive \(k\)-anonymity for social networks. In: Proceedings of the 2009 international conference on data mining (DMIN ’09). CSREA Press, Las Vegas, USA, pp 403–409

  • Gulyás GG, Imre S (2013) Hiding information in social networks from de-anonymization attacks. In: Proceedings of the 14th joint IFIP TC6 and TC11 conference on communications and multimedia security (CMS 2013), Magdeburg, Germany, pp 173–184

  • Gulyás GG, Imre S (2015) Using identity separation against de-anonymization of social networks. Trans Data Privacy (TDP) 8(2):113–140

    Google Scholar 

  • Hanhijärvi S, Garriga GC, Puolamäki K (2009) Randomization techniques for graphs. In: SIAM conference on data mining (SDM), Sparks, Nevada, USA, SIAM, pp 780–791

  • Hartung S, Hoffmann C, Nichterlein A (2014) Improved upper and lower bound heuristics for degree anonymization in social networks. In: Proceedings of the 13th international symposium on experimental algorithms (SEA ’14), Springer, Copenhagen, 376–387

  • Hartung S, Nichterlein A, Niedermeier R, Suchý O (2015) A refined complexity analysis of degree anonymization in graphs. Inf Comput 243:249–262. doi:10.1016/j.ic.2014.12.017

  • Hay M, Miklau G, Jensen D, Weis P, Srivastava S (2007) Anonymizing social networks. Technical report No. 07-19, Computer Science Department, University of Massachusetts Amherst, UMass Amherst

  • Hay M, Miklau G, Jensen D, Towsley D, Weis P (2008) Resisting structural re-identification in anonymized social networks. Proc VLDB Endow 1(1):102–114

    Article  Google Scholar 

  • Hay M, Liu K, Miklau G, Pei J, Terzi E (2011) Privacy-aware data management in information networks. In: International conference on management of data (SIGMOD), ACM Press, New York, USA, pp 1201–1204

  • He X, Vaidya J, Shafiq B, Adam N, Atluri V (2009) Preserving privacy in social networks: a structure-aware approach. In: International conference on web intelligence and intelligent agent technology (WI-IAT ’09), IEEE, Milan, Italy, pp 647–654

  • Hongwei W, Zhang J, Yang J, Wang B, Li S (2013) A clustering bipartite graph anonymous method for social networks. J Inf Comput Sci (JOICS) 10(18):6031–6040

    Article  Google Scholar 

  • Kapron BM, Srivastava G, Venkatesh S (2011) Social network anonymization via edge addition. In: IEEE international conference on advances on social networks analysis and mining (ASONAM), IEEE Computer Society, Kaohsiung, pp 155–162

  • Lan L, Ju S, Jin H (2010) Anonymizing social network using bipartite graph. In: International conference on computational and information sciences (ICCIS). IEEE Computer Society, pp 993–996

  • Li N, Li T, Venkatasubramanian S (2007) \(t\)-Closeness: privacy beyond \(k\)-anonymity and \(\ell \)-diversity. In: IEEE international conference on data engineering (ICDE), IEEE Computer Society, Istanbul, Turkey, pp 106–115

  • Liu K, Terzi E (2008) Towards identity anonymization on graphs. In: ACM SIGMOD international conference on management of data, SIGMOD ’08, ACM Press, New York, NY, USA, pp 93–106

  • Lu X, Song Y, Bressan S (2012) Fast identity anonymization on graphs. In: 23rd international conference on database and expert systems applications (DEXA ’12), Springer, Vienna, Austria, pp 281–295

  • Ma T, Zhang Y, Cao J, Shen J, Tang M, Tian Y, Al-Dhelaan A, Al-Rodhaan M (2015) KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm. Computing 97(12):1165–1184

    Article  MathSciNet  MATH  Google Scholar 

  • Machanavajjhala A, Kifer D, Gehrke J, Venkitasubramaniam M (2007) \(\ell \)-diversity: privacy beyond \(k\)-anonymity. ACM Trans Knowl Discov Data (TKDD) 1(1):3:1–3:1

    Google Scholar 

  • Nagle F (2013) Privacy breach analysis in social networks. In: Özyer T, Erdem Z, Rokne J, Khoury S (eds) Mining social networks and security informatics. Lecture Notes in Social Networks, Springer, Netherlands, Dordrecht, pp 63–77

  • Nagle F, Singh L, Gkoulalas-Divanis A (2012) EWNI: efficient anonymization of vulnerable individuals in social networks. In: Proceedings of the 16th Pacific-Asia conference on advances in knowledge discovery and data mining (PAKDD), Springer, Berlin, pp 359–370

  • Narayanan A, Shmatikov V (2009) De-anonymizing social networks. In: IEEE symposium on security and privacy (SP), IEEE Computer Society, Washington, DC, USA, pp 173–187

  • Nguyen HH, Imine A, Rusinowitch M (2014) A maximum variance approach for graph anonymization. In: The 7th international symposium on foundations and practice of security FPS’2014, Springer, Montréal, Canada, pp 1–16

  • Nguyen HH, Imine A, Rusinowitch M (2015) Anonymizing social graphs via uncertainty semantics. In: Proceedings of the 10th ACM symposium on information, computer and communications security, ASIA CCS ’15, Singapore, pp 495–506

  • Samarati P (2001) Protecting respondents’ identities in microdata release. IEEE Trans Knowl Data Eng (TKDE) 13(6):1010–1027

    Article  Google Scholar 

  • Sharad K, Danezis G (2014) An automated social graph de-anonymization technique. In: Proceedings of the 13th workshop on privacy in the electronic society—WPES ’14, ACM Press, New York, NY, USA, pp 47–58

  • Sihag VK (2012) A clustering approach for structural \(k\)-anonymity in social networks using genetic algorithm. In: CUBE international information technology conference, ACM, pp 701–706

  • Singh L, Schramm C (2010) Identifying similar neighborhood structures in private social networks. In: International conference on data mining workshops (ICDMW), IEEE, Sydney, NSW, pp 507–516

  • Stokes K, Torra V (2011) On some clustering approaches for graphs. In: 2011 IEEE international conference on fuzzy systems (FUZZ-IEEE), IEEE, pp 409–415

  • Stokes K, Torra V (2012) Reidentification and \(k\)-anonymity: a model for disclosure risk in graphs. Soft Comput 16(10):1657–1670

    Article  MATH  Google Scholar 

  • Sweeney L (2002) \(k\)-Anonymity: a model for protecting privacy. Int J Uncertainty Fuzziness Knowl Based Syst (IJUFKS) 10(5):557–570

    Article  MathSciNet  MATH  Google Scholar 

  • Tai C-H, Yu PS, Yang D-N, Chen M-S (2011) Privacy-preserving social network publication against friendship attacks. In: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining (KDD ’11), ACM Press, New York, USA, pp 1262–1270

  • Torra V (2010) Privacy in data mining. In: Maimon O, Rokach L (eds) Data mining and knowledge discovery handbook. Springer, New York, pp 687–716 doi:10.1007/978-0-387-09823-4

  • Tripathy BK, Panda GK (2010) A new approach to manage security against neighborhood attacks in social networks. In: IEEE international conference on advances on social networks analysis and mining (ASONAM), IEEE, Odense, Denmark, pp 264–269

  • Vuokko N, Terzi E (2010) Reconstructing randomized social networks. In: SIAM conference on data mining (SDM), Columbus, Ohio, USA, pp 49–59

  • Wu L, Ying X, Wu X (2010a) Reconstruction from randomized graph via low rank approximation. In: SIAM conference on data mining (SDM), SDM 2010, SIAM, Columbus, Ohio, USA, pp 60–71

  • Wu X, Ying X, Liu K, Chen L (2010b) Managing and mining graph data, chapter A survey of privacy-preservation of graphs and social networks. Springer, US, Boston, MA, pp 421–453. doi:10.1007/978-1-4419-6045-0_14

  • Ying X, Wu X (2008) Randomizing social networks: a spectrum preserving approach. In: SIAM conference on data mining (SDM), SIAM, Atlanta, Georgia, USA, pp 739–750

  • Ying X, Wu X (2009a) On link privacy in randomizing social networks. In: Pacific-Asia conference on advances in knowledge discovery and data mining, PAKDD ’09, Springer, Berlin, pp 28–39

  • Ying X, Wu X (2009b) Graph generation with prescribed feature constraints. In: SIAM conference on data mining (SDM), SDM 2009, SIAM, Sparks, Nevada, USA, pp 966–977

  • Ying X, Pan K, Wu X, Guo L (2009) Comparisons of randomization and K-degree anonymization schemes for privacy preserving social network publishing. In: Workshop on social network mining and analysis, SNA-KDD ’09, ACM Press, New York, USA, pp 10:1–10:10

  • Yuan M, Chen L, Yu PS, Ting Y (2013) Protecting sensitive labels in social network data anonymization. IEEE Trans Knowl Data Eng 25(3):633–647

    Article  Google Scholar 

  • Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: ACM SIGKDD international conference on privacy, security, and trust (PinKDD), vol 4890 of Lecture notes in computer science. Springer, Berlin, pp 153–171

  • Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. In: IEEE international conference on data engineering (ICDE), IEEE Computer Society, Washington, DC, USA, pp 506–515

  • Zhou B, Pei J (2011) The \(k\)-anonymity and \(\ell \)-diversity approaches for privacy preservation in social networks against neighborhood attacks. Knowl Inf Syst (KAIS) 28(1):47–77

    Article  Google Scholar 

  • Zhou B, Pei J, Luk WS (2008) A brief survey on anonymization techniques for privacy preserving publishing of social network data. ACM SIGKDD Explor Newsl 10(2):12–22

    Article  Google Scholar 

  • Zou L, Chen L, Tamer Özsu M (2009) K-Automorphism: a general framework for privacy preserving network publication. Proc VLDB Endow 2(1):946–957

    Article  Google Scholar 

Download references

Acknowledgments

This work was partly funded by the Spanish Government through projects TIN2011-27076-C03-02 “CO-PRIVACY”, TIN2014-57364-C2-2-R “SMARTGLACIS” and TIN2014-55243-P and the Catalan AGAUR Grant 2014SGR-691.

Author information

Authors and Affiliations

  1. Faculty of Computer Science, Multimedia and Telecommunications, Internet Interdisciplinary Institute (IN3), Universitat Oberta de Catalunya, Barcelona, Spain

    Jordi Casas-Roma

  2. Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, Bellaterra, Spain

    Jordi Herrera-Joancomartí

  3. School of Informatics, University of Skövde, Skövde, Sweden

    Vicenç Torra

Authors
  1. Jordi Casas-Roma
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jordi Herrera-Joancomartí
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vicenç Torra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jordi Casas-Roma.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Casas-Roma, J., Herrera-Joancomartí, J. & Torra, V. A survey of graph-modification techniques for privacy-preserving on networks. Artif Intell Rev 47, 341–366 (2017). https://doi.org/10.1007/s10462-016-9484-8

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-016-9484-8

Keywords

Search

Navigation