Privacy, accuracy, and consistency too: A holistic solution to contingency table release

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2007, Pages 273-282

  Barak, Boaz ^a   Chaudhuri, Kamalika ^b   Dwork, Cynthia ^c   Kale, Satyen ^a   McSherry, Frank ^c   Talwar, Kunal ^c  

^a PRINCETON UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

Contingency table release; OLAP; Privacy

Indexed keywords

CONTINGENCY TABLE RELEASE; PRIVACY GUARANTEES;

DATA PRIVACY; ERROR ANALYSIS; FORMAL LOGIC; STATISTICAL METHODS;

DATA PROCESSING;

EID: 35448955720     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265569     Document Type: Conference Paper

References (37)

1. Special Issue on Statistical Disclosure Control, volume 14(4) of Journal of Official Statistics. 1998.
2. D. Agrawal and C. C. Aggarwal. On the design and quantification of privacy preserving data mining algorithms. In PODS. ACM, 2001.
3. R. Agrawal and R. Srikant. Privacy-preserving data, mining. In W. Chen, J. F. Naughton, and P. A. Bernstein, editors, SIGMOD Conference, pages 439-450. ACM, 2000.
4. R. Agrawal, R. Srikant, and D. Thomas. Privacy preserving OLAP. In SIGMOD '05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pages 251-262, New York, NY, USA, 2005. ACM Press.
5. M. Bacharach. Matrix rounding problems. Management Science, 9:732-742, 1966.
6. A. Blum, C. Dwork, F. McSherry, and K. Nissim. Practical privacy: the SuLQ framework. In C. Li, editor, PODS, pages 128-138. ACM, 2005.
7. J. Castro. Quadratic interior-point methods in statistical disclosure control. Computational Management Science, 2:pages 107-121, 2005.
8. J. Castro. Minimum-distance controlled perturbation methods for large-scale tabular data, protection. Euorpean Journal of Operantional Research, 171:39-52, 2006.
9. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee. Toward privacy in public databases. In J. Kilian, editor, TCC, volume 3378 of Lecture Notes in Computer Science, pages 363-385. Springer, 2005.
10. S. Chawla, C. Dwork, F. McSherry, and K. Talwar. On privacy-preserving histograms. In Proceedings of the 21th Annual Conference on Uncertainty in Artificial Intelligence (UAI-05), Arlington, Virginia, 2005. AUAI Press.
11. L. Cox, J. Kelly, and R. Patil. Balancing quality and confidentiality in multivariate tabular data. Privacy in Statistical Databases, 3080:87-98, 2004.
12. T. Dalenius. Towards a methodology for statistical disclosure control. Statistisk. tidskrift, 3:213-225, 1977.
13. R. A. Dandekar and L. Cox. Synthetic tabular data: An alternative to complementary cell suppression, 2002. manuscript, energy Information Administration, US Department of Energy.
14. I. Dinur and K. Nissim. Revealing information while preserving privacy. In Milo [26], pages 202-210.
15. A. Dobra and S. Fienberg. Bounding entries in multi-way contingency tables given a, set of marginal totals, 2002. Proceedings of Conference on Foundation of Statistical Inference and its Applicaitons.
16. J. Domingo-Ferrer and V. Torra. A critique of the sensitivity rules usually employed for statistical table protection. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):545-556, 2002.
17. G. Duncan. Confidentiality and statistical disclosure limitation. In N. Smelser and P. Baltes, editors, International Encyclopedia of the Social and Behavioral Sciences. Elsevier, 2001.
18. C. Dwork. Differential privacy. In M. Bugliesi, B. Preneel, V. Sassone, and I. Wegener, editors, ICALP (2), volume 4052 of Lecture Notes in Computer Science, pages 1-12. Springer, 2006.
19. C. Dwork, D. Lee, and F. McSherry. Privacy preserving histogram case study, 2007. Manuscript.
20. C. Dwork, F. McSherry, K. Nissim, and A. Smith. Calibrating noise to sensitivity in private data analysis. In S. Halevi and T. Rabin, editors, TCC, volume 3876 of Lecture Notes in Computer Science, pages 265-284. Springer, 2006.
21. C. Dwork, F. McSherry, and K. Talwar. The price of privacy and the limits of LP decoding. In Proceedings of the 39th annual Symposium on the Theory of Computation., 2007.
22. C. Dwork and K. Nissim. Privacy-preserving datamining on vertically partitioned databases. In M. K. Franklin, editor, CRYPTO, volume 3152 of Lecture Notes in Computer Science, pages 528-544. Springer, 2004.
23. A. V. Evfimievski, J. Gehrke, and R. Srikant. Limiting privacy breaches in privacy preserving data, mining. In Milo [26], pages 211-222.
24. I. Fellegi. On the question of statistical confidentiality. Journal of the American Statistical Association, pages 7-18, 1972.
25. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization (Algorithms and Combinatorics). Springer, December 1994.
26. T. Milo, editor. Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, June 9-12, 2003, San Diego, CA, USA. ACM, 2003.
27. J. Kelly, A. Assad, and B. Golden. The controlled rounding problem: Relaxations and complexity issues. OR Spektrum, 12:129-138, 1990.
28. T. W. Körner. Fourier Analysis. Cambridge University Press, Cambridge, UK, 1988.
29. J. A. D. Loera and S. Onn. All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables. Proceedings of the 10th Ann. Math. Prog. Soc. Symp. Integ. Prog. Combin. Optim., LNCS, 3064:338-351, 2004.
30. J. A. D. Loera and S. Onn. The complexity of three-way statistical tables. SIAM J. Comput., 33:819-836, 2004.
31. J. A. D. Loera and S. Onn. Markov bases of three-way tables are arbitrarily complicated. J. Symb. Comput., 41(2):173-181, 2006.
32. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. In L. Liu, A. Reuter, K.-Y. Whang, and J. Zhang, editors, ICDE, page 24. IEEE Computer Society, 2006.
33. D. A. Robertson and R. Ethier. Cell suppression: Experience and theory. In J. Domingo-Ferrer, editor, Inference Control in Statistical Databases, volume 2316 of Lecture Notes in Computer Science, pages 8-20. Springer, 2002.
34. D. Rubin. Discussion: Statistical disclosure limitation. Journal of Official Statistics, 9:461-469, 1993.
35. P. Samarati and L. Sweeney. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression.
36. L. Sweeney. Achieving k-anonymity privacy protection using generalization and suppression. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):571-588, 2002.
37. L. Sweeney. k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 10(5):557-570, 2002.