Database security: research and practice
Information Systems
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Practical privacy: the SuLQ framework
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the efficiency of checking perfect privacy
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A formal analysis of information disclosure in data exchange
Journal of Computer and System Sciences
Fusions of description logics and abstract description systems
Journal of Artificial Intelligence Research
A logical framework for modularity of ontologies
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Conservative extensions in expressive description logics
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Privacy in GLAV information integration
ICDT'07 Proceedings of the 11th international conference on Database Theory
Privacy in database publishing
ICDT'05 Proceedings of the 10th international conference on Database Theory
Data Privacy for $\mathcal{ALC}$ Knowledge Bases
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Query-based access control for ontologies
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Theoretical Computer Science
Privacy preserving modules for ontologies
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Justified terminological reasoning
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Hi-index | 0.00 |
We study privacy guarantees for the owner of an information system who wants to share some of the information in the system with clients while keeping some other information secret. The privacy guarantees ensure that publishing the new information will not compromise the secret one. We present a framework for describing privacy guarantees that generalises existing probabilistic frameworks in relational databases. We also formulate different flavors of privacy-preserving query answering as novel, purely logic-based reasoning problems and establish general connections between these reasoning problems and the probabilistic privacy guarantees.