Decidability of <i>k</i>-secrecy against inference attacks using functional dependencies on XML databases

概要

論文の詳細を見る
An inference attack means that a database user tries to identify, or narrow down the candidates for, sensitive information from non-sensitive information such as queries authorized to the user and their results, the schema of a database, functional dependencies satisfied by the database, etc. If the size of the candidate set is at least k, the database is said to be k-secret. In our previous papers, we targeted XML databases and proposed how to determine k-secrecy without functional dependencies. In this paper, we show the decidability of k-secrecy with functional dependencies provided that the functional dependencies satisfy a restriction called the non-prefix restriction. To be specific, we reduce the problem of finding a candidate to the satisfiability problem of functional dependencies. Then, the decision algorithm of k-secrecy is simply designed as an enumeration of candidates.
2013-07-15