Logical Foundations of Privacy-Preserving Publishing of Linked Data


  • Bernardo Cuenca Grau University of Oxford
  • Egor Kostylev University of Oxford




Linked Data, RDF Data, privacy, Semantic Web, Logic, Complexity of Reasoning


The widespread adoption of Linked Data has been driven by the increasing demand for information exchange between organisations, as well as by data publishing regulations in domains such as health care and governance. In this setting, sensitive information is at risk of disclosure since published data can be linked with arbitrary external data sources. In this paper we lay the foundations of privacy-preserving data publishing (PPDP) in the context of Linked Data. We consider anonymisations of RDF graphs (and, more generally, relational datasets with labelled nulls) and define notions of safe and optimal anonymisations. Safety ensures that the anonymised data can be published with provable protection guarantees against linking attacks, whereas optimality ensures that it preserves as much information from the original data as possible, while satisfying the safety requirement. We establish the complexity of the underpinning decision problems both under open-world semantics inherent to RDF and a closed-world semantics, where we assume that an attacker has complete knowledge over some part of the original data.




How to Cite

Cuenca Grau, B., & Kostylev, E. (2016). Logical Foundations of Privacy-Preserving Publishing of Linked Data. Proceedings of the AAAI Conference on Artificial Intelligence, 30(1). https://doi.org/10.1609/aaai.v30i1.10105



Technical Papers: Knowledge Representation and Reasoning