Direkt zum Inhalt | Direkt zur Navigation

Informatik 5
Information Systems
Prof. Dr. M. Jarke
Sektionen
Benutzerspezifische Werkzeuge
Sie sind hier: Startseite Theses Anonymising and de-anonymising of heterogeneous graph data containing personally identifiable information

Contact

Prof. Dr. M. Jarke
RWTH Aachen
Informatik 5
Ahornstr. 55
D-52056 Aachen
Tel +49/241/8021501
Fax +49/241/8022321

How to find us

Annual Reports

Disclaimer

Webmaster

 

 

Anonymising and de-anonymising of heterogeneous graph data containing personally identifiable information

Thesis type
  • Bachelor
Student Felix Hermsen
Status Finished
Submitted in 2017
File download
Supervisor(s)
Advisor(s)

We provide a new way for anonymizing a heterogeneous graph containing personal identifiable information.
The anonymization algorithm is called k-RDF-neighborhood anonymity, because it changes the one hoop neighborhood of at least k persons inside a RDF graph so that they cannot be distinguished. This preserves their privacy.
It allows us to control the loss of information in different parts of the graph to adjust the trade-off between full privacy and data utility.
We conducted an experiment, which shows that the overall loss of information is less, if the anonymization is concentrated on multiple parts of the graph instead of solely one.
Moreover, we provide a guessing based de-anonymization algorithm to test how good the anonymization protects the identity of individuals.
The result is that the anonymization algorithm protects well against the threat of re-identification, if the anonymization is strong. However, the data utility decreases, if it is strong. If the data utility is high the re-identification rate is high as well.

Artikelaktionen