Abstract
We consider a problem in secure disclosure of multiway table margins. If the value of an entry in all tables having the same margins as those released from a source table in a data base is unique, then the value of that entry can be exposed and disclosure is insecure. We settle the computational complexity of detecting whether this situation occurs. In particular, for multiway tables where one category is significantly richer than the others, that is, when each sample point can take many values in one category and only few values in the other categories, we provide, for the first time, a polynomial time algorithm for checking uniqueness, allowing disclosing agencies to check entry uniqueness and make learned decisions on secure disclosure. Our proofs use our recent results on universality of 3-way tables and on n-fold integer programming, which we survey on the way.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aoki, S., Takemura, A.: Minimal basis for connected Markov chain over 3×3×K contingency tables with fixed two-dimensional marginals. Austr. New Zeal. J. Stat. 45, 229–249 (2003)
Cox, L.H.: Bounds on entries in 3-dimensional contingency tables. In: Domingo-Ferrer, J. (ed.) Inference Control in Statistical Databases. LNCS, vol. 2316, pp. 21–33. Springer, Heidelberg (2002)
Cox, L.H.: On properties of multi-dimensional statistical tables. J. Stat. Plan. Infer. 117, 251–273 (2003)
De Loera, J., Onn, S.: The complexity of three-way statistical tables. SIAM J. Comp. 33, 819–836 (2004)
De Loera, J., Onn, S.: All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables. In: Bienstock, D., Nemhauser, G.L. (eds.) IPCO 2004. LNCS, vol. 3064, pp. 338–351. Springer, Heidelberg (2004)
De Loera, J., Onn, S.: Markov bases of three-way tables are arbitrarily complicated. J. Symb. Comp. 41, 173–181 (2006)
De Loera, J., Onn, S.: All linear and integer programs are slim 3-way transportation programs. SIAM J. Optim. (to appear)
De Loera, J., Hemmecke, R., Onn, S., Weismantel, R.: N-fold integer programming (submitted)
Duncan, G.T., Fienberg, S.E., Krishnan, R., Padman, R., Roehrig, S.F.: Disclosure limitation methods and information loss for tabular data. In: Confidentiality, Disclosure and Data Access: Theory and Practical Applications for Statistical Agencies, North-Holland (2001)
Irving, R., Jerrum, M.R.: Three-dimensional statistical data security problems. SIAM J. Comp. 23, 170–184 (1994)
Vlach, M.: Conditions for the existence of solutions of the three-dimensional planar transportation problem. Disc. App. Math. 13, 61–78 (1986)
Yemelichev, V.A., Kovalev, M.M., Kravtsov, M.K.: Polytopes, Graphs and Optimisation. Cambridge University Press, Cambridge (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Onn, S. (2006). Entry Uniqueness in Margined Tables. In: Domingo-Ferrer, J., Franconi, L. (eds) Privacy in Statistical Databases. PSD 2006. Lecture Notes in Computer Science, vol 4302. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11930242_9
Download citation
DOI: https://doi.org/10.1007/11930242_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49330-3
Online ISBN: 978-3-540-49332-7
eBook Packages: Computer ScienceComputer Science (R0)