Return to search

Computing Compliant Anonymisations of Quantified ABoxes w.r.t. EL Policies: Extended Version

We adapt existing approaches for privacy-preserving publishing of linked data to a setting where the data are given as Description Logic (DL) ABoxes with possibly anonymised (formally: existentially quantified) individuals and the privacy policies are expressed using sets of concepts of the DL EL. We provide a chacterization of compliance of such ABoxes w.r.t. EL policies, and show how optimal compliant anonymisations of ABoxes that are noncompliant can be computed. This work extends previous work on privacypreserving ontology publishing, in which a very restricted form of ABoxes, called instance stores, had been considered, but restricts the attention to compliance. The approach developed here can easily be adapted to the problem of computing optimal repairs of quantified ABoxes. / This is an extended version of an article pulished in: Proceedings of the 19th International Semantic Web Conference (ISWC 2020), Springer LNCS

Identiferoai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:79626
Date20 June 2022
CreatorsBaader, Franz, Kriegel, Francesco, Nuradiansyah, Adrian, Peñaloza, Rafael
PublisherTechnische Universität Dresden
Source SetsHochschulschriftenserver (HSSS) der SLUB Dresden
LanguageEnglish
Detected LanguageEnglish
Typeinfo:eu-repo/semantics/acceptedVersion, doc-type:report, info:eu-repo/semantics/report, doc-type:Text
Rightsinfo:eu-repo/semantics/openAccess
Relationurn:nbn:de:bsz:14-qucosa2-785040, qucosa:78504

Page generated in 0.0015 seconds