Sage Journals: Discover world-class research

Abstract

In this paper, we study the privacy breach caused by unsafe correlations in transactional data where individuals have multiple tuples in a dataset. We provide two safety constraints to guarantee safe correlation of the data: (1) the safe grouping constraint to ensure that quasi-identifier and sensitive partitions are bounded by l-diversity and (2) the schema decomposition constraint to eliminate non-arbitrary correlations between non-sensitive and sensitive values to protect privacy and at the same time increase the aggregate analysis. In our technique, values are grouped together in unique partitions that enforce l-diversity at the level of individuals. We also propose an association preserving technique to increase the ability to learn/analyze from the anonymized data. To evaluate our approach, we conduct a set of experiments to determine the privacy breach and investigate the anonymization cost of safe grouping and preserving associations.

Keywords

Data privacy data anonymization transactional data

Get full access to this article

View all access options for this article.

References

D.J.

Aldous, Exchangeability and related topics, in: École D’été de Probabilités de Saint-Flour, XIII – 1983, Lecture Notes in Math., Vol. 1117, Springer, Berlin, 1985, pp. 1–198.

Asuncion and

D.J.

Newman, UCI machine learning repository, 2007.

Chi-Wing Wong,

Wai-Chee Fu,

Wang,

Xu and

P.S.

Yu, Can the utility of anonymized data be used for privacy breaches?, in: CoRR, 2009, 0905.1755.

Ciriani,

De Capitani Di Vimercati,

Foresti,

Jajodia,

Paraboschi and

Samarati, Combining fragmentation and encryption to protect privacy in data storage, ACM Trans. Inf. Syst. Secur.13 (2010), 22:1–22:33.

Hacıgümüş,

B.R.

Iyer and

Mehrotra, Executing SQL over encrypted data in the database-service-provider model, in: Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, Madison, WI, June 4–6, 2002, 2002, pp. 216–227.

Jiang,

Gao,

Wang and

Yang, Multiple sensitive association protection in the outsourced database, in: Database Systems for Advanced Applications (DASFAA), Tsukuba, Japan, April 1–4, 2010, 2010, pp. 123–137.

Kantarcioglu,

Inan and

Kuzu, Anonymization toolbox, 2010.

Kifer, Attacks on privacy and De Finetti’s theorem, in: SIGMOD Conference, 2009, pp. 127–138.

Li,

Li and

Venkatasubramanian, t-closeness: Privacy beyond k-anonymity and l-diversity, in: ICDE, 2007, pp. 106–115.

10.

Li and

Li, Injector: Mining background knowledge for data anonymization, in: ICDE, 2008, pp. 446–455.

11.

Li,

Zhang and

Molloy, Slicing: A new approach for privacy preserving data publishing, IEEE Trans. Knowl. Data Eng.24(3) (2012), 561–574.

12.

Machanavajjhala,

Gehrke,

Kifer and

Venkitasubramaniam, l-diversity: Privacy beyond k-anonymity, in: Proceedings of the 22nd IEEE International Conference on Data Engineering (ICDE 2006), Atlanta, GA, April 2006, 2006.

13.

Machanavajjhala,

Gehrke,

Kifer and

Venkitasubramaniam, l-diversity: Privacy beyond k-anonymity, ACM Transactions on Knowledge Discovery from Data (TKDD)1(1) (2007), 1010–1027.

14.

Malin, Trail re-identification and unlinkability in distributed databases, PhD thesis, Carnegie Mellon University, 2006.

15.

A.E.

Nergiz and

Clifton, Query processing in private data outsourcing using anonymization, in: The 25th IFIP WG 11.3 Conference on Data and Applications Security and Privacy (DBSEC-11), Richmond, VA, July 11–13, 2011, 2011, pp. 11–13.

16.

A.E.

Nergiz,

Clifton and

Malluhi, Updating outsourced anatomized private databases, in: 16th International Conference on Extending Database Technology (EDBT), Genoa, Italy, March 18–22, 2013, 2013.

17.

Ressel, De Finetti-type theorems: an analytical approach, Ann. Probab.13(3) (1985), 898–922.

18.

Samarati, Protecting respondents’ identities in microdata release, IEEE Trans. Knowl. Data Eng.13(6) (2001), 1010–1027.

19.

Sweeney, k-anonymity: a model for protecting privacy, International Journal on Uncertainty, Fuzziness and Knowledge-based Systems10(5) (2002), 557–570.

20.

Sweeney, Achieving k-anonymity privacy protection using generalization and suppression, International Journal on Uncertainty, Fuzziness and Knowledge-based Systems10(5) (2002), 571–588.

21.

Terrovitis,

Mamoulis and

Kalnis, Privacy-preserving anonymization of set-valued data, Proc. VLDB Endow.1(1) (2008), 115–125.

22.

Terrovitis,

Mamoulis,

Liagouris and

Skiadopoulos, Privacy preservation by disassociation, Proc. VLDB Endow.5(10) (2012), 944–955.

23.

Wang and

B.C.M.

Fung, Anonymizing sequential releases, in: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD’06, ACM, New York, NY, USA, 2006, pp. 414–423.

24.

Xiao and

Tao, Anatomy: Simple and effective privacy preservation, in: Proceedings of 32nd International Conference on Very Large Data Bases (VLDB 2006), Seoul, Korea, September 12–15, 2006, 2006, pp. 12–15.

Anonymizing transactional datasets

Abstract

Keywords

Get full access to this article

References