Studer, Thomas; Werner, Johannes Martin (2014). Censors for Boolean Description Logic. Transactions on Data Privacy, 7(3), pp. 223-252.
![[img]](https://boris.unibe.ch/style/images/fileicons/text.png) |
Text
tdp.a138a13.pdf - Published Version Restricted to registered users only Available under License Publisher holds Copyright. Download (319kB) |
Protecting different kinds of information has become an important area of research. One aspect is to provide effective means to avoid that secrets can be deduced from the answers of legitimate queries. In the context of atomic propositional databases several methods have been developed to achieve this goal. However, in those databases it is not possible to formalize structural information. Also they are quite restrictive with respect to the specification of secrets. In this paper we extend those methods to match the much greater expressive power of Boolean description logics. In addition to the formal framework, we provide a discussion of various kinds of censors and establish different levels of security they can provide.
Item Type: |
Journal Article (Original Article) |
|---|---|
Division/Institute: |
08 Faculty of Science > Institute of Computer Science (INF) > Logic and Theory Group (LTG) 08 Faculty of Science > Institute of Computer Science (INF) |
UniBE Contributor: |
Studer, Thomas, Werner, Johannes Martin |
Subjects: |
000 Computer science, knowledge & systems 500 Science > 510 Mathematics |
ISSN: |
1888-5063 |
Language: |
English |
Submitter: |
Florian Ranzi |
Date Deposited: |
26 Jan 2015 09:44 |
Last Modified: |
05 Dec 2022 14:39 |
BORIS DOI: |
10.7892/boris.61797 |
URI: |
https://boris.unibe.ch/id/eprint/61797 |
Actions (login required)
 |
Edit item |