An inference detection algorithm based on related tuples mining

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Existing algorithms on inference detection for database systems mainly employ functional dependencies in the database schema to detect inference, but what they can detect is limited. This paper presents a new data level inference detection algorithm. It can determine whether sensitive information can be disclosed from the user's query history through finding the related tuples between the return results of different queries. If two tuples are related to each other, then they will be merged into one tuple, thus the query history can be compressed. Moreover, the merged tuple has more information than the original two or more tuples. The experiment results show that, as the query number increases, our algorithm can infer almost the whole original relation; meanwhile the query history is compressed remarkablely. The system administrator should restrict user's query number and category to ensure that the database is secure. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Cui, B., & Liu, D. (2005). An inference detection algorithm based on related tuples mining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3683 LNAI, pp. 1011–1017). Springer Verlag. https://doi.org/10.1007/11553939_142

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free