{"type":"ScholarlyArticle","title":"Reasoning about Disclosure in Data Integration in the Presence of Source Constraints","authors":[{"name":"Michael Benedikt","slug":"michael-benedikt","given":"Michael","family":"Benedikt","affiliation":"University of Oxford"},{"name":"Pierre Bourhis","slug":"pierre-bourhis","given":"Pierre","family":"Bourhis","affiliation":"CNRS CRIStAL , Université Lille , Inria Lille"},{"name":"Louis Jachiet","slug":"louis-jachiet","given":"Louis","family":"Jachiet","affiliation":"CNRS CRIStAL , Université Lille , Inria Lille"},{"name":"Michaël Thomazo","slug":"michael-thomazo","given":"Michael","family":"Thomazo","affiliation":"Inria , DI ENS , ENS , CNRS , PSL University"}],"abstract":"Data integration systems allow users to access data sitting in multiple sources by means of queries over a global schema, related to the sources via mappings. Datasources often contain sensitive information, and thus an analysis is needed to verify that a schema satisfies a privacy policy, given as a set of queries whose answers should not be accessible to users. Such an analysis should take into account not only knowledge that an attacker may have about the mappings, but also what they may know about the semantics of the sources.In this paper, we show that source constraints can have a dramatic impact on disclosure analysis. We study the problem of determining whether a given data integration system discloses a source query to an attacker in the presence of constraints, providing both lower and upper bounds on source-aware disclosure analysis.","doi":"10.24963/ijcai.2019/215","url":"https://ijcai.org/proceedings/2019/215","pdf":"https://ijcai.org/proceedings/2019/0215.pdf","markdown":"https://ijcai.org/proceedings/2019/215.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/215","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":215,"pages":{"first":1551,"last":1557},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Knowledge Representation and Reasoning: Description Logics and Ontologies"],"videos":[],"references":[{"position":1,"raw":"[Abiteboul and Duschka, 1998] Serge Abiteboul and Olivier Duschka. Complexity of answering queries using materi- alized views. In PODS, pages 254-263, 1998.","title":"Complexity of answering queries using materialized views","authors":"Duschka Abiteboul, Serge Abiteboul, Olivier Duschka","year":"1998","venue":"PODS","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ahmetaj et al., 2016] Shqiponja Ahmetaj, Magdalena Or- tiz, and Mantas Šimkus. Polynomial datalog rewritings for expressive description logics with closed predicates. In IJCAI, pages 878-885, 2016.","title":"Shqiponja Ahmetaj, Magdalena Ortiz, and Mantas Šimkus. Polynomial datalog rewritings for expressive description logics with closed predicates","authors":"Ahmetaj","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Amarilli and Benedikt, 2018] Antoine Amarilli and Michael Benedikt. When Can We Answer Queries Using Result-Bounded Data Interfaces? In PODS, pages 281-293, 2018.","title":"When Can We Answer Queries Using Result-Bounded Data Interfaces? In PODS","authors":"Benedikt Amarilli, Antoine Amarilli, Michael Benedikt","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Amendola et al., 2018] Giovanni Amendola, Nicola Leone, Marco Manna, and Pierfrancesco Veltri. Enhancing exis- tential rules by closed-world variables. In IJCAI, pages 1676-1682, 2018.","title":"Enhancing existential rules by closed-world variables","authors":"Giovanni Amendola, Nicola Leone, Marco Manna, Pierfrancesco Veltri","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/232"},{"position":5,"raw":"[Baget et al., 2011] Jean-Franc ¸ois Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. On rules with ex- istential variables: Walking the decidability line. Artif. In- tell., 175(9-10), 2011.","title":"On rules with existential variables: Walking the decidability line","authors":"Baget","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bárány et al., 2015] Vince Bárány, Balder Ten Cate, and Luc Segoufin. Guarded negation. J. ACM, 62(3):356-367, 2015.","title":"Guarded negation","authors":"Vince Bárány, Ten Balder, Luc Cate, Segoufin","year":"2015","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Benedikt et al., 2016] Michael Benedikt, Pierre Bourhis, Balder ten Cate, and Gabriele Puppis. Querying visible and invisible information. In LICS, pages 297-306, 2016.","title":"Querying visible and invisible information","authors":"Michael Benedikt, Pierre Bourhis, Gabriele Balder Ten Cate, Puppis","year":"2016","venue":"LICS","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Benedikt et al., 2018] Michael Benedikt, Bernardo Cuenca Grau, and Egor V. Kostylev. Logical foundations of infor- mation disclosure in ontology-based data integration. Ar- tif. Intell., 262:52-95, 2018.","title":"Logical foundations of information disclosure in ontology-based data integration","authors":"Michael Benedikt, Bernardo Cuenca Grau, Egor V Kostylev","year":"2018","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Biskup and Weibert, 2008] Joachim Biskup and Torben Weibert. Keeping Secrets in Incomplete Databases. Int. J. Inf. Sec., 7(3):199-217, 2008.","title":"Keeping Secrets in Incomplete Databases","authors":"Weibert Biskup, Joachim Biskup, Torben Weibert","year":"2008","venue":"Int. J. Inf. Sec","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bonatti and Sauro, 2013] Piero A. Bonatti and Luigi Sauro. A confidentiality model for ontologies. In ISWC, pages 17-32, 2013.","title":"A confidentiality model for ontologies","authors":"A Piero, Luigi Bonatti, Sauro","year":"2013","venue":"ISWC","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bonatti et al., 1995] Piero Bonatti, Sarit Kraus, and V. S. Subrahmanian. Foundations of Secure Deductive Databases. TKDE, 7(3):406-422, 1995.","title":"Foundations of Secure Deductive Databases","authors":"Piero Bonatti, Sarit Kraus, V S Subrahmanian","year":"1995","venue":"TKDE","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Calì et al., 2013] Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering under expressive relational constraints. JAIR, pages 70-80, 2013.","title":"Taming the infinite chase: Query answering under expressive relational constraints","authors":"Andrea Calì, Georg Gottlob, Michael Kifer","year":"2013","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Casanova et al., 1984] Marco Casanova, Ronald Fagin, and Christos Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. JCSS, 28(1):29- 59, 1984.","title":"Inclusion dependencies and their interaction with functional dependencies","authors":"Marco Casanova, Ronald Fagin, Christos Papadimitriou","year":"1984","venue":"JCSS","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Cosmadakis et al., 1990] Stavros S. Cosmadakis, Paris C. Kanellakis, and Moshe Y. Vardi. Polynomial-time implica- tion problems for unary inclusion dependencies. J. ACM, 37(1):15-46, 1990.","title":"Polynomial-time implication problems for unary inclusion dependencies","authors":"Stavros S Cosmadakis, Paris C Kanellakis, Moshe Y Vardi","year":"1990","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Dwork, 2006] Cynthia Dwork. Differential privacy. In ICALP, pages 1-12, 2006.","title":"Differential privacy","authors":"Cynthia Dwork","year":"2006","venue":"ICALP","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Fagin et al., 2005] Ronald Fagin, Phokion G. Kolaitis, Re- nee J. Miller, and Lucian Popa. Data Exchange: Seman- tics and Query Answering. Theoretical Computer Science, 336(1):89-124, 2005.","title":"Data Exchange: Semantics and Query Answering","authors":"Ronald Fagin, G Phokion, Renee J Kolaitis, Lucian Miller, Popa","year":"2005","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Franconi et al., 2011] Enrico Franconi, Yasmin Ibáñez- García, and Inanc ¸Seylan. Query answering with DBoxes is hard. ENTCS, 278:71-84, 2011.","title":"Query answering with DBoxes is hard","authors":"Enrico Franconi, Yasmin Ibáñez-García, Inanc ¸seylan","year":"2011","venue":"ENTCS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Johnson and Klug, 1984] David S. Johnson and Anthony C. Klug. Testing Containment of Conjunctive Queries un- der Functional and Inclusion Dependencies. JCSS, 28(1), 1984.","title":"Testing Containment of Conjunctive Queries under Functional and Inclusion Dependencies","authors":"David S Johnson, Anthony C Klug","year":"1984","venue":"JCSS","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Lenzerini, 2002] Maurizio Lenzerini. Data integration: A theoretical perspective. In PODS, pages 233-246, 2002.","title":"Data integration: A theoretical perspective","authors":"Maurizio Lenzerini","year":"2002","venue":"PODS","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lutz et al., 2013] Carsten Lutz, Inanc ¸Seylan, and Frank Wolter. Ontology-based data access with closed predicates is inherently intractable (sometimes). In IJCAI, pages 1024-1030, 2013.","title":"Ontology-based data access with closed predicates is inherently intractable (sometimes)","authors":"Carsten Lutz, Frank Inanc ¸seylan, Wolter","year":"2013","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2013/156"},{"position":21,"raw":"[Lutz et al., 2015] Carsten Lutz, Inanc ¸Seylan, and Frank Wolter. Ontology-mediated queries with closed predicates. In IJCAI, pages 3120-3126, 2015.","title":"Ontology-mediated queries with closed predicates","authors":"Carsten Lutz, Frank Inanc ¸seylan, Wolter","year":"2015","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2015/440"},{"position":22,"raw":"[Studer and Werner, 2014] Thomas Studer and Johannes Werner. Censors for Boolean Description Logic. Trans. on Data Privacy, 7(3):223-252, 2014.","title":"Censors for Boolean Description Logic","authors":"Werner ; Studer, Thomas Studer, Johannes Werner","year":"2014","venue":"Trans. on Data Privacy","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}