Project

Back to overview

Logics for Privacy

English title Logics for Privacy
Applicant Studer Thomas
Number 132070
Funding scheme Project funding (Div. I-III)
Research institution Institut für Informatik Universität Bern
Institution of higher education University of Berne - BE
Main discipline Information Technology
Start/End 01.05.2011 - 30.04.2014
Approved amount 180'259.00
Show all

All Disciplines (2)

Discipline
Information Technology
Mathematics

Keywords (7)

data privacy; description logic; ontologies; controlled query evaluation; workflow control-flow patterns; logic; knowledge representation

Lay Summary (English)

Lead
Lay summary
The problem of data privacy is to verify that confidential information stored in an information system is not provided to unauthorized users and, therefore, personal and other sensitive data remain private. The main challenge in such a context is to share some data while protecting other personally identifiable information. The aim of our project is to develop formal methods and the corresponding algorithms to enable automated reasoning about data privacy.Data stored in a relational database or knowledge base system usually is protected from unauthorized access. Users of such a system are then only allowed to access a limited portion of the stored information. In this situation the following important questions arise:1. What can a user infer from the information to which he has access?2. Can we guarantee that a user cannot obtain knowledge about certain sensitive information?3. Is it possible to grant a user information access in such a way that she is able to fulfill her duties without letting her know secret information?We will address these question not in their full generality, but we intend to study the following concrete issue.Controlled query evaluation is an approach to privacy preserving query answering where the answer to a query is distorted if it would leak sensitive information to the user. We plan to develop a formal framework to enable controlled query evaluation for ontological knowledge base systems. To achieve this aim we will mainly use tools and techniques from modal logic in general and description logic in particular.
Direct link to Lay Summary Last update: 21.02.2013

Responsible applicant and co-applicants

Employees

Publications

Publication
A universal approach to guarantee data privacy
Studer Thomas (2013), A universal approach to guarantee data privacy, in Logica Universalis, 7(2), 195-209.
Justified Terminological Reasoning
Studer Thomas (2012), Justified Terminological Reasoning, in Perspectives of System Informatics PSI'11, Springer, LNCS 7162, Springer, Berlin Heidelberg.
An application of justification logic to protocol verification
Studer Thomas (2011), An application of justification logic to protocol verification, in 7th Int. Conf. on Computational Intelligence and Security, IEEE, 2011, IEEE, Los Alamitos, CA, USA.
Justification Logic, Inference Tracking, and Data Privacy
Studer Thomas (2011), Justification Logic, Inference Tracking, and Data Privacy, in Logic and Logical Philosophy, 20(4), 297-306.

Scientific events

Active participation

Title Type of contribution Title of article or contribution Date Place Persons involved
LIX Colloquium 2013 on the Theory and Application of Formal Proofs Talk given at a conference Towards syntactic cut-elimination for temporal logics 05.11.2013 Paris, France Studer Thomas;
Tenth International Tbilisi Symposium on Language, Logic and Computation Talk given at a conference Censors for Boolean Description Logic 23.09.2013 Tbilisi, Georgia Werner Johannes Martin;
Logic and Applications Talk given at a conference Cut elimination for modal fixed point logics 16.09.2013 Dubrovnik, Croatia Studer Thomas;
Logic Colloquium 2013 Talk given at a conference Censoring Knowledge in Boolean Description Logic 22.07.2013 Evora, Portugal Werner Johannes Martin;
World Congress on Universal Logic Talk given at a conference Update as Evidence 03.04.2013 Rio de Janeiro, Brazil Studer Thomas;
Seventh International Conference on Computational Intelligence and Security Talk given at a conference An Application of Justification Logic to Protocol Verification 03.12.2011 Sanya, China Studer Thomas;
Perspectives of System Informatics PSI'11 Talk given at a conference Justified Terminological Reasoning 27.06.2011 Novosibirsk, Russia Studer Thomas;


Associated projects

Number Title Start Funding scheme
112191 Dynamic Ontologies 01.04.2006 Project funding (Div. I-III)
153096 Logics for Privacy 01.05.2014 Project funding (Div. I-III)
153096 Logics for Privacy 01.05.2014 Project funding (Div. I-III)

Abstract

The problem of data privacy is to verify that confidential information stored in an information system is not provided to unauthorized users and, therefore, personal and other sensitive data remain private. The main challenge in such a context is to share some data while protecting other personally identifiable information. The general aim of our project is to develop formal methods and the corresponding algorithms to enable automated reasoning about data privacy.Our concrete plan consists of (i) developing controlled query evaluation mechanisms for ontological knowledge base systems, and (ii) extending classical workflow patterns with privacy guarantees.
-