Minimal data upgrading to prevent inference and association attacks
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards a Possibilistic Logic Handling of Preferences
Applied Intelligence
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Keeping secrets in incomplete databases
International Journal of Information Security
ACM Transactions on Information and System Security (TISSEC)
Data Privacy for $\mathcal{ALC}$ Knowledge Bases
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Using SAT-Solvers to compute inference-proof database instances
DPM'09/SETOP'09 Proceedings of the 4th international workshop, and Second international conference on Data Privacy Management and Autonomous Spontaneous Security
Towards controlled query evaluation for incomplete first-order databases
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Fuzzy Role-Based Access Control
Information Processing Letters
Revising belief without revealing secrets
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
| Hi-index | 0.00 |
Controlled Query Evaluation (CQE) is a logical framework for the protection of secrets in databases. In this article, we extend the CQE framework to possibilistic logic: knowledge base, a priori knowledge and privacy policy are expressed with necessity-valued formulas that represent several degrees of certainty. We present a formal security definition and analyze an appropriate controlled evaluation algorithm for this possibilistic case.