A Formal Model of Data Privacy

Information systems support data privacy by constraining user's access to public views and thereby hiding the non-public underlying data. The privacy problem is to prove that none of the private data can be inferred from the information which is made public. We present a formal definition of the privacy problem which is based on the notion of certain answer. Then we investigate the privacy problem in the contexts of relational databases and ontology based information systems.

[1]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

[2]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[3]  Catriel Beeri,et al.  A Proof Procedure for Data Dependencies , 1984, JACM.

[4]  H. P Gassmann,et al.  OECD guidelines governing the protection of privacy and transborder flows of personal data , 1981 .

[5]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[6]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[7]  Andrea Calì,et al.  Data integration under integrity constraints , 2004, Inf. Syst..

[8]  Marcelo Arenas,et al.  XML data exchange: consistency and query answering , 2005, PODS '05.

[9]  Thomas Eiter,et al.  Database Theory - Icdt 2005 , 2008 .

[10]  Ramakrishnan Srikant,et al.  Hippocratic Databases , 2002, VLDB.

[11]  Ernesto Damiani,et al.  Controlling Access to XML Documents , 2001, IEEE Internet Comput..

[12]  Carsten Lutz,et al.  E-connections of abstract description systems , 2004, Artif. Intell..

[13]  Dan Suciu,et al.  A formal analysis of information disclosure in data exchange , 2004, SIGMOD '04.

[14]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[15]  Sarit Kraus,et al.  Foundations of Secure Deductive Databases , 1995, IEEE Trans. Knowl. Data Eng..

[16]  Bijan Parsia,et al.  Automatic Partitioning of OWL Ontologies Using E-Connections , 2005, Description Logics.

[17]  Wenfei Fan,et al.  Keys with Upward Wildcards for XML , 2001, DEXA.

[18]  Joachim Biskup,et al.  Controlled query evaluation for enforcing confidentiality in complete information systems , 2004, International Journal of Information Security.

[19]  Ashwin Machanavajjhala,et al.  On the efficiency of checking perfect privacy , 2006, PODS '06.

[20]  Jürgen Dix,et al.  The Relationship Between Reasoning About Privacy and Default Logics , 2005, LPAR.

[21]  Gunter Saake,et al.  Logics for databases and information systems , 1998 .

[22]  Pierangela Samarati,et al.  Generalizing Data to Provide Anonymity when Disclosing Information , 1998, PODS 1998.

[23]  Kilian Stoffel,et al.  Provable Data Privacy , 2005, DEXA.

[24]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[25]  Ron van der Meyden,et al.  Logical Approaches to Incomplete Information: A Survey , 1998, Logics for Databases and Information Systems.

[26]  Marianne Winslett,et al.  Formal query languages for secure relational databases , 1994, TODS.

[27]  Alin Deutsch,et al.  Privacy in Database Publishing , 2005, ICDT.