On Rough Sets and Inference Analysis (1997)
| Venue: | In International Workshop on Information Security, LNCS |
| Citations: | 2 - 0 self |
BibTeX
@INPROCEEDINGS{Zhang97onrough,
author = {Kan Zhang},
title = {On Rough Sets and Inference Analysis},
booktitle = {In International Workshop on Information Security, LNCS},
year = {1997},
pages = {256--265}
}
OpenURL
Abstract
. In this paper, we give an overview of a promising approach to inference detection and analysis in relational databases, first introduced in [25]. The approach employs techniques from rough sets theory and is able to take into account of all certain and possible material implications in the data, including functional dependencies. It can also be used to address inference threats posed by rule-induction techniques from data mining. A major advantage of this approach is that the quantitative measure IRI is computed directly from data without knowledge input from System Security Officer. By comparing with other techniques, we attempt to convey the merits of rough sets based approach. 1 Introduction In multilevel databases, inference problem has long been identified as a major threat to security. An inference problem in a multilevel database arises when a user with a low-level clearance, accessing information of low classification, is able to draw conclusions about information at higher ...







