liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Graph k-Anonymity through k-Means and as Modular Decomposition
Linköping University, Department of Computer and Information Science, Database and information techniques. Linköping University, The Institute of Technology.
2013 (English)In: SECURE IT SYSTEMS, NORDSEC 2013, Springer Berlin/Heidelberg, 2013, Vol. 8208, 263-278 p.Conference paper, Published paper (Refereed)
Abstract [en]

In this paper we discuss k-anonymous graphs in terms of modular decomposition and we present two algorithms for the k-anonymization of graphs with respect to neighborhoods. This is the strictest definition of k-anonymity for graphs. The first algorithm is an adaptation of the k-means algorithm to neighborhood clustering in graphs. The second algorithm is distributed of message passing type, and therefore enables user-privacy: the individuals behind the vertices can jointly protect their own privacy. Although these algorithms are not optimal in terms of information loss, they are a first example of algorithms that provide k-anonymization of graphs with respect to the strictest definition, and they are simple to implement.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2013. Vol. 8208, 263-278 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 8208
Keyword [en]
k-anonymity; graph; modular decomposition; message passing; distributed algorithm; k-means; user-privacy
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:liu:diva-110507DOI: 10.1007/978-3-642-41488-6_18ISI: 000340414300018ISBN: 978-3-642-41487-9 (print)ISBN: 978-3-642-41488-6 (print)OAI: oai:DiVA.org:liu-110507DiVA: diva2:746388
Conference
18th Nordic Conference on Secure IT Systems, NordSec 2013; Ilulissat; Greenland
Available from: 2014-09-12 Created: 2014-09-12 Last updated: 2014-12-08

Open Access in DiVA

No full text

Other links

Publisher's full text

Authority records BETA

Stokes, Klara

Search in DiVA

By author/editor
Stokes, Klara
By organisation
Database and information techniquesThe Institute of Technology
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 21 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf