Catalytic Inference Analysis: Detecting Inference Threats due to Knowledge Discovery

Authors:
John Hale;Sujeet Shenoi
Affiliations:
-;-
Venue:
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
Year:
1997

Citing 0
Cited 9

The inference problem: a survey

ACM SIGKDD Explorations Newsletter
Dynamic inference control

DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
A privacy-preserving index for range queries

VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Web-based inference detection

SS'07 Proceedings of 16th USENIX Security Symposium on USENIX Security Symposium
Evaluating privacy threats in released database views by symmetric indistinguishability

Journal of Computer Security - Selected papers from the Third and Fourth Secure Data Management (SDM) workshops
A systematic literature review of inference strategies

International Journal of Information and Computer Security
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
Indistinguishability: the other aspect of privacy

SDM'06 Proceedings of the Third VLDB international conference on Secure Data Management
Probabilistic Inference Channel Detection and Restriction Applied to Patients' Privacy Assurance

International Journal of Information Security and Privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

Knowledge discovery in databases can be enhanced by introducing "catalytic relations" conveying external knowledge. The new information catalyzes database inference, manifesting latent channels. Catalytic inference is imprecise in nature, but the granularity of inference may be fine enough to create security compromises. Catalytic inference is computationally intensive. However, it can be automated by advanced search engines that gather and assemble knowledge from information repositories. The relentless information gathering potential of such search engines makes them formidable security threats.This paper presents a formalism for modeling and analyzing catalytic inference in "mixed'' databases containing various precise, imprecise and fuzzy relations. The inference formalism is flexible and robust, and well-suited to implementation.