AUDITING AND INFERENCE CONTROL IN STATISTICAL DATABASES.

Abstract

This study presents a practical technique for managing the past history of user's queries, discuss how the sequence of all the answered queries of the SDB can be reduced and stored in finite storage, and describe how this storage scheme can provide an effective way of checking compromise. The authors believe that this will help us develop a more practical and efficient tool for protection in a small SDB than the previously known mechanisms. Further, the authors extend the idea to checking compromise of a set of queries in a more efficient way than one query at a time. It is shown that the problem of maximizing the amount of information to the users without compromising the SDB is NP-complete.