Proceedings. 1988 IEEE Symposium on Security and Privacy
DOI: 10.1109/secpri.1988.8101
|View full text |Cite
|
Sign up to set email alerts
|

Inference aggregation detection in database management systems

Abstract: This paper makes seven contributions to security aggregation research. It identifies inference aggregation and cardinality aggregation as two distinct aspects of the aggregation problem. The paper develops the concept of a semantic relationship graph to describe the relationships between data and then presents inference aggregation as the problem of finding alternative paths between vertices on the graph. An algorithm is presented for processing the semantic relationship graph to discover whether potential inf… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
33
0

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 82 publications
(36 citation statements)
references
References 2 publications
0
33
0
Order By: Relevance
“…Hinke [96] shows a further depth to aggregation by comparing general cardinality aggregations and inference aggregation in which predictions of inference emerge from data analysis activities. Here, not only are similar activities from antecedent processes joined in an integrated output.…”
Section: Integrationmentioning
confidence: 99%
“…Hinke [96] shows a further depth to aggregation by comparing general cardinality aggregations and inference aggregation in which predictions of inference emerge from data analysis activities. Here, not only are similar activities from antecedent processes joined in an integrated output.…”
Section: Integrationmentioning
confidence: 99%
“…Another key direction of research involves role-based access control. For a sampling of relevant literature on these topics, see [34,71,97,106,165,193,194,195,291,294,295,320,324,325,384,410,411].…”
Section: Large Databases and Inferencementioning
confidence: 99%
“…The exclusion of U from V , denoted V | ¬U , is the view obtained from V by appending to its selection condition the negation of the selection condition of U . 3 Obviously, V = (V | U ) ∪ (V | ¬U ).…”
Section: Concept Disclosurementioning
confidence: 99%
“…In the environment of relational databases, this implies that the release of a limited number of tuples would be permitted, but once this number exceeds a predetermined threshold, security might be breached. This problem of controlled disclosure of sensitive information is an example of what is known as the aggregation problem [5,3,6,7,2,4].…”
Section: Introductionmentioning
confidence: 99%