%0 Conference Paper
%F Oral 
%T fQuery: SPARQL Query Rewriting to Enforce Data Confidentiality
%+ Département Logique des Usages, Sciences sociales et Sciences de l'Information (LUSSI)
%+ Lab-STICC_TB_CID_SFIIS
%+ SWID web performance (Entreprise) (SWID)
%A Oulmakhzoune, Said
%A Cuppens-Bouhlahia, Nora
%A Cuppens, Frédéric
%A Morucci, Stephane
%< avec comité de lecture
%Z 15322
%B DBSEC 2010 : 24th annual IFIP WG 11.3 working conference on data and applications security and privacy XXIV
%C Roma, Italy
%Y Sara Foresti; Sushil Jajodia
%I Springer
%S Lecture Notes in Computer Science
%V 6166
%P 146-161
%8 2010-06-21
%D 2010
%R 10.1007/978-3-642-13739-6_10
%Z Computer Science [cs]/Digital Libraries [cs.DL]Conference papers
%X RDF is an increasingly used framework for describing Web resources, including sensitive and confidential resources. In this context, we need an expressive language to query RDF databases. SPARQL has been defined to easily localize and extract data in an RDF graph. Since confidential data are accessed, SPARQL queries must be filtered so that only authorized data are returned with respect to some confidentiality policy. In this paper, we model a confidentiality policy as a set of positive and negative filters (corresponding respectively to permissions and prohibitions) that apply to SPARQL queries. We then define rewriting algorithms that transform the queries so that the results returned by transformed queries are compliant with the confidentiality policy.
%G English
%2 https://inria.hal.science/hal-01056741/document
%2 https://inria.hal.science/hal-01056741/file/_26.pdf
%L hal-01056741
%U https://inria.hal.science/hal-01056741
%~ UNIV-BREST
%~ INSTITUT-TELECOM
%~ CNRS
%~ UNIV-UBS
%~ ENIB
%~ LAB-STICC_ENIB
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-LNCS-6166
%~ LAB-STICC
%~ LAB-STICC_TB
%~ IFIP-2010
%~ IMTA_LUSSI
%~ LAB-STICC_IMTA
%~ IMT-ATLANTIQUE
%~ INSTITUTS-TELECOM