Disclosure detection in multivariate categorical databases: Auditing confidentiality protection through two new matrix operators

Disclosure detection in multivariate categorical databases: Auditing confidentiality protection through two new matrix operators

0.00 Avg rating0 Votes
Article ID: iaor20016
Country: United States
Volume: 45
Issue: 12
Start Page Number: 1710
End Page Number: 1723
Publication Date: Dec 1999
Journal: Management Science
Authors: , , , ,
Keywords: information, networks: flow, programming: linear
Abstract:

As databases grow more prevalent and comprehensive, database administrators seek to limit disclosure of confidential information while still providing access to data. Practical databases accommodate users with heterogeneous needs for access. Each class of data user is accorded access to only certain views. Other views are considered confidential, and hence to be protected. Using illustrations from health care and education, this article addresses inferential disclosure of confidential views in multidimensional categorical databases. It demonstrates that any structural, so data-value-independent method for detecting disclosure can fail. Consistent with previous work for two-way tables, it presents a data-value-dependent method to obtain tight lower and upper bounds for confidential data values. For two-dimensional projections of categorical databases, it exploits the network structure of a linear programming (LP) formulation to develop two transportation flow algorithms that are both computationally efficient and insightful. These algorithms can be easily implemented through two new matrix operators, cell-maxima and cell-minima. Collectively, this method is called matrix comparative assignment (MCA). Finally, it extends both the LP and MCA approaches to inferential disclosure when accessible views have been masked.

Reviews

Required fields are marked *. Your email address will not be published.