Keith B. Frikken
ABSTRACT
Recently many schemes, including k-anonymity [8], l-diversity [6] and t-closeness [5] have been introduced for preserving individual privacy when publishing database tables. Furthermore k-anonymity and l-diversity have been shown to have weaknesses. In this paper, we show that t-closeness also has limitations, more specifically we argue that: i) choosing the correct value for t is difficult, ii) t-closeness does not allow some values of sensitive attributes to be more sensitive than other values, and iii) to prevent certain types of privacy leaks t must be set to such a small value that it produces low-quality published data. In this paper we propose a new privacy metric,(αi, βi)-closeness, that mitigates these problems. We also show how to calculate an optimal release table (in the full domain model) that satisfies (αi, βi)-closeness and we present experimental results that show that the data quality provided by 9αi, β;i),-closeness is higher than t-closeness, k-anonymity, and l-diversity while achieving the same privacy goals.
- R. Bayardo and R. Agrawal. Data privacy through optimal k-anonymization. In ICDE'05: Proceedings of the 21st International Conference on Data Engineering, pages 217--228, Washington, DC, USA, 2005. IEEE Computer Society. Google Scholar
Digital Library
- B. Chen, R. Ramakrishnan, and K. LeFevre. Privacy skyline: Privacy with multidimensional adversarial knowledge. In VLDB'07: Proceedings of the 33rd international conference on Very large data bases, pages 770--781. VLDB Endowment, 2007. Google ScholarDigital Library
- K. LeFevre, D.J. DeWitt, and R. Ramakrishnan. Incognito: efficient full-domain k-anonymity. In SIGMOD'05: Proceedings of the 2005 ACM SIGMOD international conference on Management of data, pages 49---60, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- K. LeFevre, D.J. DeWitt, and R. Ramakrishnan. Mondrian multidimensional k-anonymity. In ICDE'06: Proceedings of the 22nd International Conference on Data Engineering, page 25, Washington, DC, USA, 2006. IEEE Computer Society. Google ScholarDigital Library
- N. Li, T. Li, and s. Venkatasubramanian. t-closeness: Privacy beyond k-anonymity and l-diversity. In ICDE'07: Proceedings of the 23rd International Conference on Data Engineering, pages 106--115, Washington, DC, USA, 2007. IEEE Computer Society.Google Scholar
- A. Machanavajjhala, D. Kifer, J. Gehrke, and M. Venkitasubramaniam. L-diversity: Privacy beyond k-anonymity. ACM Trans. Knowl. Discov. Data, 1(1):3, 2006. Google ScholarDigital Library
- D. Martin, D. Kifer, A. Machanavajjhala, J. Gehrke, and J. Halpern. Worst-case background knowledge. In ICDE'07: Proceedings of the 21st International Conference on Data Engineering, pages 126--135. IEEE Computer Society, 2007.Google Scholar
- L. Sweeney. k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst., 10(5):557--570, 2002. Google ScholarDigital Library
- R. C. Wong, J. Li, A. W. Fu, and K. Wang. (α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In KDD '06: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 754--759, New York, NY, USA, 2006. ACM. Google ScholarDigital Library
- X. Xiao and Y. Tao. Anatomy: simple and effective privacy preservation. In VLDB'06: Proceedings of the 32nd international conference on Very large data bases, pages 139--150. VLDB Endowment, 2006. Google ScholarDigital Library
- X. Xiao and Y. Tao. Personalized privacy preservation. In SIGMOD'06: Proceedings of the 2006 ACM SIGMOD international conference on Management of data, pages 229--240, New York, NY, USA, 2006. ACM. Google ScholarDigital Library
- X. Xiao and Y. Tao. M-invariance: towards privacy preserving re-publication of dynamic datasets. In SIGMOD'07: Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pages 689--700, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
Index Terms
- Yet another privacy metric for publishing micro-data
Recommendations
(α, k)-anonymous data publishing
Privacy preservation is an important issue in the release of data for mining purposes. The k-anonymity model has been introduced for protecting individual identification. Recent studies show that a more sophisticated model is necessary to protect the ...
An effective value swapping method for privacy preserving data publishing
Privacy is an important concern in the society, and it has been a fundamental issue when to analyze and publish data involving human individual's sensitive information. Recently, the slicing method has been popularly used for privacy preservation in ...
Generalized bucketization scheme for flexible privacy settings
Bucketization is an anonymization technique for publishing sensitive data. The idea is to group records into small buckets to obscure the record-level association between sensitive information and identifying information. Compared to the traditional ...
Comments