Information disclosure under realistic assumptions: Privacy versus optimality

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2007, Pages 573-583

  Zhang, Lei ^a   Jajodia, Sushil ^a,b   Brodsky, Alexander ^a  

^a George Mason University   (United States)

^b MITRE CORPORATION   (United States)

Author keywords

Disclosure Al gorithm; Information disclosure; Privacy preservation

Indexed keywords

DATA UTILITIES; INFORMATION DISCLOSURE; MICRODATA; NP-HARD PROBLEM; OPTIMAL ALGORITHM; OPTIMALITY; POLYNOMIAL-TIME; PRIVACY PRESERVATION; RESEARCH COMMUNITIES; SAFETY CONDITION; SAFETY PROPERTY; SCHEMAS;

ALGORITHMS; ALUMINUM; OPTIMIZATION; POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 66249085387     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1315245.1315316     Document Type: Conference Paper

References (28)

1. A. Dobra and S. E. Feinberg. Bounding entries in multi-way contingency tables given a set of marginal totals. In Foundations of Statistical Inference: Proceedings of the Shoresh Conference 2000. Springer Verlag, 2003.
2. A. Machanavajjhala, J. Gehrke, D. Kifer, and M. Venkitasubramaniam. l-diversity: Privacy beyond k-anonymity. In Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE 2006), 2006.
3. A. Slavkovic and S. E. Feinberg. Bounds for cell entries in two-way tables given conditional relative frequencies. Privacy in Statistical Databases, 2004.
4. V. Ciriani, S. D. C. di Vimercati, S. Foresti, and P. Samarati. k-anonymity. In Secure Data Management in Decentralized Systems (edited by T. Yu and S. Jajodia). Springer-Verlag, 2007.
5. D. Kifer and J. Gehrke. Injecting utility into anonymized datasets. In SIGMOD, 2006.
6. D. P. Dobkin, A. K. Jones, and R. J. Lipton. Secure databases: Protection against user influence. ACM: Transactions on Database Systems (TODS), 4 (1):76-96, 1979.
7. F. Chin. Security problems on inference control for sum, max, and min queries. J. ACM, 33 (3):451-464, 1986.
8. G. Aggarwal, T. Feder, K. Kenthapadi, R. Motwani, R. Panigrahy, D. Thomas, and A. Zhu. k-anonymity: Algorithms and hardness. Technical report, Stanford University, 2004.
9. G. Miklau and D. Suciu. A formal analysis of information disclosure in data exchange. In SIGMOD, 2004.
10. G. T. Duncan and S. E. Feinberg. Obtaining information while preserving privacy: A markov perturbation method for tabular data. In Joint Statistical Meetings. Anaheim, CA, 1997.
11. I. P. Fellegi. aOn the question of statistical confidentiality. Journal of the American Statistical Association, 67 (337):7-18, 1993.
12. J. Kleinberg, C. Papadimitriou, and P. Raghavan. Auditing boolean attributes. In PODS, 2000.
13. J. Schlorer. Identification and retrieval of personal records from a statistical bank. In Methods Info. Med., 1975.
14. K. Kenthapadi, N. Mishra, and K. Nissim. Simulatable auditing. In PODS, 2005.
15. K. LeFevre, D. DeWitt, and R. Ramakrishnan. Incognito: Efficient fulldomain k-anonymity. In SIGMOD, 2005.
16. L. H. Cox. Solving confidentiality protection problems in tabulations using network optimization: A network model for cell suppression in the u.s. economic censuses. In Proceedings of the Internatinal Seminar on Statistical Confidentiality, pages 229-245. International Statistical Institute, Dublin, 1982.
17. L. H. Cox. New results in disclosure avoidance for tabulations. In International Statistical Institute Proceedings of the 46th Session, pages 83-84. Tokyo, 1987.
18. L. H. Cox. Suppression, methodology and statistical disclosure control. Journal of the American Statistical Association, 90:1453-1462, 1995.
19. L. Sweeney. k-anonymity: a model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-based Systems, 10 (5):557-570, 2002.
20. A. Meyerson and R. Williams. On the complexity of optimal k-anonymity. In ACM Symposium on Principles of Database Systems (PODS), 2004.
21. N. R. Adam and J. C. Wortmann. Security-control methods for statistical databases: A comparative study. ACM Comput. Surv., 21 (4):515-556, 1989.
22. P. Diaconis and B. Sturmfels. Algebraic algorithms for sampling from conditional distributions. Annals of Statistics, 1:363-397, 1998.
23. P. Samarati. Protecting respondents' identities in microdata release. In IEEE Transactions on Knowledge and Data Engineering, pages 1010-1027, 2001.
24. P. Samarati and L. Sweeney. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression. Technical report, CMU, SRI, 1998.
25. R. J. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In ICDE-2005, 2005.
26. S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee. Toward privacy in public databases. In Theory of Cryptography Conference, 2005.
27. T. Dalenius and S. Reiss. Data swapping: A technique for disclosure control. Journal of Statistical Planning and Inference, 6:73-85, 1982.
28. X. Xiao and Y. Tao. Personalized privacy preservation. In SIGMOD, 2006.