Query-Based Linked Data Anonymization

We introduce and develop a declarative framework for privacy-preserving Linked Data publishing in which privacy and utility policies are specified as SPARQL queries. Our approach is data-independent and leads to inspect only the privacy and utility policies in order to determine the sequence of anonymization operations applicable to any graph instance for satisfying the policies. We prove the soundness of our algorithms and gauge their performance through experiments.

[1]  Franz Baader,et al.  The Identity Problem in Description Logic Ontologies and Its Application to View-Based Information Hiding , 2017, JIST.

[2]  Serena Villata,et al.  An Access Control Model for Linked Data , 2011, OTM Workshops.

[3]  Wim Martens,et al.  An Analytical Study of Large SPARQL Query Logs , 2017, Proc. VLDB Endow..

[4]  Asunción Gómez-Pérez,et al.  Towards the Anonymisation of RDF Data , 2015, SEKE.

[5]  François Goasdoué,et al.  Reformulation-based query answering in RDF: alternatives and performance , 2015, Proc. VLDB Endow..

[6]  Philip S. Yu,et al.  Privacy-preserving data publishing: A survey of recent developments , 2010, CSUR.

[7]  Franz Baader,et al.  Preliminary Results on the Identity Problem in Description Logic Ontologies , 2017, Description Logics.

[8]  Carsten Lutz,et al.  Efficient Query Rewriting in the Description Logic EL and Beyond , 2015, IJCAI.

[9]  Serena Villata,et al.  Privacy, security and policies: A review of problems and solutions with semantic web technologies , 2018, Semantic Web.

[10]  Ninghui Li,et al.  t-Closeness: Privacy Beyond k-Anonymity and l-Diversity , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[11]  George H. L. Fletcher,et al.  gMark: Schema-Driven Generation of Graphs and Queries , 2015, IEEE Transactions on Knowledge and Data Engineering.

[12]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[13]  Nora Cuppens-Boulahia,et al.  Privacy Policy Preferences Enforced by SPARQL Query Rewriting , 2012, 2012 Seventh International Conference on Availability, Reliability and Security.

[14]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[15]  Cynthia Dwork,et al.  Differential Privacy , 2006, ICALP.

[16]  Stefan Decker,et al.  k - RDF-Neighbourhood Anonymity: Combining Structural and Attribute-based Anonymisation for Linked Data , 2017, PrivOn@ISWC.

[17]  ASHWIN MACHANAVAJJHALA,et al.  L-diversity: privacy beyond k-anonymity , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[18]  Egor V. Kostylev,et al.  Logical Foundations of Privacy-Preserving Publishing of Linked Data , 2016, AAAI.

[19]  Ashwin Machanavajjhala,et al.  Differential Privacy in the Wild: A Tutorial on Current Practices & Open Challenges , 2016, Proc. VLDB Endow..

[20]  Stefan Decker,et al.  Access control and the Resource Description Framework: A survey , 2016, Semantic Web.