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
Lying versus refusal for known potential secrets
Data Engineering
Controlled Query Evaluation for Known Policies by Combining Lying and Refusal
FoIKS '02 Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems
The inference problem: a survey
ACM SIGKDD Explorations Newsletter
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Controlled Query Evaluation for Known Policies by Combining Lying and Refusal
Annals of Mathematics and Artificial Intelligence
Dynamic inference control in privacy preference enforcement
Proceedings of the 2006 International Conference on Privacy, Security and Trust: Bridge the Gap Between PST Technologies and Business Services
Safety in discretionary access control for logic-based publish-subscribe systems
Proceedings of the 14th ACM symposium on Access control models and technologies
A scheme for inference problems using rough sets and entropy
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part II
Auditing and inference control for privacy preservation in uncertain environments
EuroSSC'06 Proceedings of the First European conference on Smart Sensing and Context
| Hi-index | 0.00 |
An inference channel exists if it is possible for a low-clearance user to infer high-classification data from low-classification data. Inference channels can be blocked by upgrading the security classification of some of the low-level data. The task of eliminating inferencechannels is formulated for solution by the Davis-Putnam theorem-proving procedure. The procedure is augmented to search for solutions with minimum total upgrade cost.