Skip to main content
Erschienen in: Knowledge and Information Systems 3/2016

01.06.2016 | Regular Paper

Splitting anonymization: a novel privacy-preserving approach of social network

verfasst von: Yongjiao Sun, Ye Yuan, Guoren Wang, Yurong Cheng

Erschienen in: Knowledge and Information Systems | Ausgabe 3/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Large amount of personal social information is collected and published due to the rapid development of social network technologies and applications, and thus, it is quite essential to take privacy preservation and prevent sensitive information leakage. Most of current anonymizing techniques focus on the preservation to privacies, but cannot provide accurate answers to utility queries even at a high price. To solve the problem, a novel anonymizing approach, called splitting anonymization, is introduced in this paper to point against the contradiction of privacy and utility. This approach provides a high-level preservation to the privacy of social network data that is unknown to attackers, which avoids the low utility caused by the enforced noises on knowledge that is already known to the attackers. Social network processed by splitting anonymization can refuse any direct attack, and these strategies are also safe enough to indirect attacks which are usually more dangerous than direct attacks. Finally, strict theoretical analysis and large amount of evaluation results based on real data sets verified the design of this paper.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Literatur
4.
Zurück zum Zitat Narayanan A, Shmatikov V (2009) De-anonymizing Social Networks. In: IEEE symposium on security and privacy, pp 173–187 Narayanan A, Shmatikov V (2009) De-anonymizing Social Networks. In: IEEE symposium on security and privacy, pp 173–187
9.
Zurück zum Zitat Hay M, Miklau G, Jensen D, Towsley DF, Li C (2010) Resisting structural re-identification in anonymizedsocialnetworks. VLDB J 19(6):797–823CrossRef Hay M, Miklau G, Jensen D, Towsley DF, Li C (2010) Resisting structural re-identification in anonymizedsocialnetworks. VLDB J 19(6):797–823CrossRef
10.
Zurück zum Zitat Hay M, Miklau G, Jensen D, Towsley DF, Weis P (2008) Resisting structural re-identification in anonymizedsocialnetworks. PVLDB 1(1):102–114 Hay M, Miklau G, Jensen D, Towsley DF, Weis P (2008) Resisting structural re-identification in anonymizedsocialnetworks. PVLDB 1(1):102–114
11.
Zurück zum Zitat Campan A, Truta T (2008) A clustering approach for dataand structural anonymity in social networks. In: PinKDD, pp 33–54 Campan A, Truta T (2008) A clustering approach for dataand structural anonymity in social networks. In: PinKDD, pp 33–54
12.
Zurück zum Zitat Tassa T, Cohen D (2013) Anonymization of centralized and distributed social networks by sequential clustering. IEEE Trans Knowl Data Eng 25(2):311–324CrossRef Tassa T, Cohen D (2013) Anonymization of centralized and distributed social networks by sequential clustering. IEEE Trans Knowl Data Eng 25(2):311–324CrossRef
13.
Zurück zum Zitat Cormode G, Srivastava D, Bhagat S, Krishnamurthy B (2009) Class-based graph anonymizationforsocial network data. PVLDB 2(1):766–777 Cormode G, Srivastava D, Bhagat S, Krishnamurthy B (2009) Class-based graph anonymizationforsocial network data. PVLDB 2(1):766–777
14.
Zurück zum Zitat Cormode G, Srivastava D, Yu T, Zhang Q (2008) Anonymizing bipartite graph data using safe groupings. PVLDB 1(1):833–844 Cormode G, Srivastava D, Yu T, Zhang Q (2008) Anonymizing bipartite graph data using safe groupings. PVLDB 1(1):833–844
15.
Zurück zum Zitat Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: Bonchi F, Malin B, Saygin Y (eds) PinKDD 2007, vol 4890. Springer, Heidelberg, pp 153–171 Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: Bonchi F, Malin B, Saygin Y (eds) PinKDD 2007, vol 4890. Springer, Heidelberg, pp 153–171
16.
Zurück zum Zitat Liu K, Terzi E (2008) Towards identity anonymizationongraphs. In: SIGMOD conference, pp 93–106 Liu K, Terzi E (2008) Towards identity anonymizationongraphs. In: SIGMOD conference, pp 93–106
17.
Zurück zum Zitat Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. In: ICDE 2008, pp 506–515 Zhou B, Pei J (2008) Preserving privacy in social networks against neighborhood attacks. In: ICDE 2008, pp 506–515
18.
Zurück zum Zitat Thompson B, Yao D (2009) The union-split algorithm and cluster-based anonymization of social networks. In: ASIACCS, pp 218–227 Thompson B, Yao D (2009) The union-split algorithm and cluster-based anonymization of social networks. In: ASIACCS, pp 218–227
19.
Zurück zum Zitat Zou L, Chen L, Özsu MT (2009) K-automorphism: ageneral framework for privacy preserving networkpublication. PVLDB 2(1):946–957 Zou L, Chen L, Özsu MT (2009) K-automorphism: ageneral framework for privacy preserving networkpublication. PVLDB 2(1):946–957
20.
Zurück zum Zitat Wu W, Xiao Y, Wang W, He Z, Wang Z (2010) k-Symmetry model for identity anonymization in socialnetworks. In: EDBT, pp 111–122 Wu W, Xiao Y, Wang W, He Z, Wang Z (2010) k-Symmetry model for identity anonymization in socialnetworks. In: EDBT, pp 111–122
21.
Zurück zum Zitat Hay M, Miklau G, Jensen D, Weis P, Srivastava S (2007) Anonymizing social networks. Computer science department faculty publication series, p 180 Hay M, Miklau G, Jensen D, Weis P, Srivastava S (2007) Anonymizing social networks. Computer science department faculty publication series, p 180
22.
Zurück zum Zitat Hochba D (1997) Approximation algorithms for NP-Hard problems. SIGACT News 28(2):40–52CrossRef Hochba D (1997) Approximation algorithms for NP-Hard problems. SIGACT News 28(2):40–52CrossRef
23.
Zurück zum Zitat Zou L, Chen L, Tamer Özsu M (2009) Distance join: pattern match query in a large graph database international conference on very large data bases, VLDB Zou L, Chen L, Tamer Özsu M (2009) Distance join: pattern match query in a large graph database international conference on very large data bases, VLDB
24.
Zurück zum Zitat Zou L, Chen L, Tamer Özsu M, Zhao D (2012) Answering pattern match queries in large graph databases via graph embedding. VLDB J 21(1):97–120CrossRef Zou L, Chen L, Tamer Özsu M, Zhao D (2012) Answering pattern match queries in large graph databases via graph embedding. VLDB J 21(1):97–120CrossRef
25.
Zurück zum Zitat Zou L, Mo J, Chen L, Tamer Özsu M, Zhao D (2011) gStore: answering SPARQL queries via subgraph matching international conference on very large data bases, VLDB Zou L, Mo J, Chen L, Tamer Özsu M, Zhao D (2011) gStore: answering SPARQL queries via subgraph matching international conference on very large data bases, VLDB
26.
Zurück zum Zitat Xifeng Y, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data. ACM Xifeng Y, Yu PS, Han J (2004) Graph indexing: a frequent structure-based approach. In: Proceedings of the 2004 ACM SIGMOD international conference on management of data. ACM
27.
Zurück zum Zitat Zheng W, Zou L, Feng Y, Chen L, Zhao D (2013) Efficient sim rank-based similarity join over large graphs international conference on very large data bases, VLDB Zheng W, Zou L, Feng Y, Chen L, Zhao D (2013) Efficient sim rank-based similarity join over large graphs international conference on very large data bases, VLDB
Metadaten
Titel
Splitting anonymization: a novel privacy-preserving approach of social network
verfasst von
Yongjiao Sun
Ye Yuan
Guoren Wang
Yurong Cheng
Publikationsdatum
01.06.2016
Verlag
Springer London
Erschienen in
Knowledge and Information Systems / Ausgabe 3/2016
Print ISSN: 0219-1377
Elektronische ISSN: 0219-3116
DOI
https://doi.org/10.1007/s10115-015-0855-2

Weitere Artikel der Ausgabe 3/2016

Knowledge and Information Systems 3/2016 Zur Ausgabe