Provable Data Privacy

Stoffel, Kilian; Studer, Thomas

doi:10.1007/11546924_32

Cited by 20 publications

(26 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Of course, this is only a toy example. For privacy issues concerning similar real world data we refer to [9]. The set ∆ includes the following facts:…”

Section: Inference Trackingmentioning

confidence: 99%

Justification logic, inference tracking, and data privacy

Studer

2013

LLP

Self Cite

View full text Add to dashboard Cite

show abstract

“…Of course, this is only a toy example. For privacy issues concerning similar real world data we refer to [9]. The set ∆ includes the following facts:…”

Section: Inference Trackingmentioning

confidence: 99%

Justification logic, inference tracking, and data privacy

Studer

2013

LLP

Self Cite

View full text Add to dashboard Cite

show abstract

“…as well as administrative data (kind of insurance, length of stay in hospital, diagnosis). Here we will not use real world data from this statistics (see [16] for privacy issues of the real world data), but only use the same kind of information the SFSO statistics provide.…”

Section: Problem Settingmentioning

confidence: 99%

A Universal Approach to Guarantee Data Privacy

Studer

2012

Log. Univers.

Self Cite

View full text Add to dashboard Cite

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. One way to guarantee this is to distort a knowledge base such that it does not reveal sensitive information. In the present paper we will give a universal definition of the problem of knowledge base distortion. It is universal in the sense that is independent of any particular knowledge representation formalism. We will then present a basic and general algorithm for knowledge base distortion to guarantee data privacy. This algorithm provides us with upper bounds for the complexity of the distortion problem. Moreover, we examine heuristics to improve its average performance.

show abstract

“…The privacy notion we study is provable data privacy which has been introduced in the context of relational database systems [1]. This notion has later been extended to logic based systems in [2].…”

Section: Introductionmentioning

confidence: 99%