 |
Free and accessible knowledge |
Conference papers
RDF graph anonymization robust to data linkage
Abstract : Privacy is a major concern when publishing new datasets in the context of Linked Open Data (LOD). A new dataset published in the LOD is indeed exposed to privacy breaches due to the linkage to objects already present in the other datasets of the LOD. In this paper, we focus on the problem of building safe anonymizations of an RDF graph to guarantee that linking the anonymized graph with any external RDF graph will not cause privacy breaches. Given a set of privacy queries as input, we study the data-independent safety problem and the sequence of anonymization operations necessary to enforce it. We provide sufficient conditions under which an anonymization instance is safe given a set of privacy queries. Additionally, we show that our algorithms for RDF data anonymization are robust in the presence of sameAs links that can be explicit or inferred by additional knowledge.
Cited literature [24 references]
https://hal.archives-ouvertes.fr/hal-02444752
Contributor : Rémy Delanaux Connect in order to contact the contributor
Submitted on : Sunday, January 19, 2020 - 7:15:48 AM
Last modification on : Wednesday, April 6, 2022 - 3:48:36 PM
Long-term archiving on: : Monday, April 20, 2020 - 12:10:56 PM
Contributor : Rémy Delanaux Connect in order to contact the contributor
Submitted on : Sunday, January 19, 2020 - 7:15:48 AM
Last modification on : Wednesday, April 6, 2022 - 3:48:36 PM
Long-term archiving on: : Monday, April 20, 2020 - 12:10:56 PM
File
paper.pdf
Files produced by the author(s)