K-anonymity on sensitive transaction items

Shyue Liang Wang, Yu Chuan Tsai, Hung-Yu Kao, Tzung Pei Hong

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

K-anonymity-based techniques [9], [11], [15]-[17] have been the main anonymization techniques on relational data ad transactional data to protect privacy against re-identification attacks. Assuming the existence of both sensitive attributes and quasi-identifier (QI) attributes, a relational dataset D is k-anonymous if every record in D has at least k-1 other records with identical quasi-identifier attribute values, but with different sensitive attribute values. However, existing k-anonymity on transactional data treats all items as quasi-identifiers. The anonymized data set has k identical transactions in groups and suffered from lower data utility [6]-[7][10][18]-[19] . In this work, we propose a new anonymity concept on transactional data with quasi-identifier items and sensitive items (SI). For a transaction that contains sensitive items, there must exist at least k-1 other identical transactions [5][20]. For a transaction that does not contain sensitive item, no anonymization is required. A transactional data set satisfying this property is called sensitive k-anonymous. We proposed two algorithms, Sensitive Transaction Neighbors (STN) and Gray Sort Clustering (GSC), by adding/deleting QI items and adding SI items to achieve sensitive k-anonymity on transactional data. Extensive numerical experiments were given to demonstrate the characteristics of the proposed concept and approaches.

Original languageEnglish
Title of host publicationProceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011
Pages723-727
Number of pages5
DOIs
Publication statusPublished - 2011 Dec 1
Event2011 IEEE International Conference on Granular Computing, GrC 2011 - Kaohsiung, Taiwan
Duration: 2011 Nov 82011 Nov 10

Publication series

NameProceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011

Other

Other2011 IEEE International Conference on Granular Computing, GrC 2011
CountryTaiwan
CityKaohsiung
Period11-11-0811-11-10

Fingerprint

Experiments

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Wang, S. L., Tsai, Y. C., Kao, H-Y., & Hong, T. P. (2011). K-anonymity on sensitive transaction items. In Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011 (pp. 723-727). [6122687] (Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011). https://doi.org/10.1109/GRC.2011.6122687
Wang, Shyue Liang ; Tsai, Yu Chuan ; Kao, Hung-Yu ; Hong, Tzung Pei. / K-anonymity on sensitive transaction items. Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011. 2011. pp. 723-727 (Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011).
@inproceedings{b3d28fdda636451e99d2554b3795fadb,
title = "K-anonymity on sensitive transaction items",
abstract = "K-anonymity-based techniques [9], [11], [15]-[17] have been the main anonymization techniques on relational data ad transactional data to protect privacy against re-identification attacks. Assuming the existence of both sensitive attributes and quasi-identifier (QI) attributes, a relational dataset D is k-anonymous if every record in D has at least k-1 other records with identical quasi-identifier attribute values, but with different sensitive attribute values. However, existing k-anonymity on transactional data treats all items as quasi-identifiers. The anonymized data set has k identical transactions in groups and suffered from lower data utility [6]-[7][10][18]-[19] . In this work, we propose a new anonymity concept on transactional data with quasi-identifier items and sensitive items (SI). For a transaction that contains sensitive items, there must exist at least k-1 other identical transactions [5][20]. For a transaction that does not contain sensitive item, no anonymization is required. A transactional data set satisfying this property is called sensitive k-anonymous. We proposed two algorithms, Sensitive Transaction Neighbors (STN) and Gray Sort Clustering (GSC), by adding/deleting QI items and adding SI items to achieve sensitive k-anonymity on transactional data. Extensive numerical experiments were given to demonstrate the characteristics of the proposed concept and approaches.",
author = "Wang, {Shyue Liang} and Tsai, {Yu Chuan} and Hung-Yu Kao and Hong, {Tzung Pei}",
year = "2011",
month = "12",
day = "1",
doi = "10.1109/GRC.2011.6122687",
language = "English",
isbn = "9781457703713",
series = "Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011",
pages = "723--727",
booktitle = "Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011",

}

Wang, SL, Tsai, YC, Kao, H-Y & Hong, TP 2011, K-anonymity on sensitive transaction items. in Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011., 6122687, Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011, pp. 723-727, 2011 IEEE International Conference on Granular Computing, GrC 2011, Kaohsiung, Taiwan, 11-11-08. https://doi.org/10.1109/GRC.2011.6122687

K-anonymity on sensitive transaction items. / Wang, Shyue Liang; Tsai, Yu Chuan; Kao, Hung-Yu; Hong, Tzung Pei.

Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011. 2011. p. 723-727 6122687 (Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - K-anonymity on sensitive transaction items

AU - Wang, Shyue Liang

AU - Tsai, Yu Chuan

AU - Kao, Hung-Yu

AU - Hong, Tzung Pei

PY - 2011/12/1

Y1 - 2011/12/1

N2 - K-anonymity-based techniques [9], [11], [15]-[17] have been the main anonymization techniques on relational data ad transactional data to protect privacy against re-identification attacks. Assuming the existence of both sensitive attributes and quasi-identifier (QI) attributes, a relational dataset D is k-anonymous if every record in D has at least k-1 other records with identical quasi-identifier attribute values, but with different sensitive attribute values. However, existing k-anonymity on transactional data treats all items as quasi-identifiers. The anonymized data set has k identical transactions in groups and suffered from lower data utility [6]-[7][10][18]-[19] . In this work, we propose a new anonymity concept on transactional data with quasi-identifier items and sensitive items (SI). For a transaction that contains sensitive items, there must exist at least k-1 other identical transactions [5][20]. For a transaction that does not contain sensitive item, no anonymization is required. A transactional data set satisfying this property is called sensitive k-anonymous. We proposed two algorithms, Sensitive Transaction Neighbors (STN) and Gray Sort Clustering (GSC), by adding/deleting QI items and adding SI items to achieve sensitive k-anonymity on transactional data. Extensive numerical experiments were given to demonstrate the characteristics of the proposed concept and approaches.

AB - K-anonymity-based techniques [9], [11], [15]-[17] have been the main anonymization techniques on relational data ad transactional data to protect privacy against re-identification attacks. Assuming the existence of both sensitive attributes and quasi-identifier (QI) attributes, a relational dataset D is k-anonymous if every record in D has at least k-1 other records with identical quasi-identifier attribute values, but with different sensitive attribute values. However, existing k-anonymity on transactional data treats all items as quasi-identifiers. The anonymized data set has k identical transactions in groups and suffered from lower data utility [6]-[7][10][18]-[19] . In this work, we propose a new anonymity concept on transactional data with quasi-identifier items and sensitive items (SI). For a transaction that contains sensitive items, there must exist at least k-1 other identical transactions [5][20]. For a transaction that does not contain sensitive item, no anonymization is required. A transactional data set satisfying this property is called sensitive k-anonymous. We proposed two algorithms, Sensitive Transaction Neighbors (STN) and Gray Sort Clustering (GSC), by adding/deleting QI items and adding SI items to achieve sensitive k-anonymity on transactional data. Extensive numerical experiments were given to demonstrate the characteristics of the proposed concept and approaches.

UR - http://www.scopus.com/inward/record.url?scp=84863047202&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863047202&partnerID=8YFLogxK

U2 - 10.1109/GRC.2011.6122687

DO - 10.1109/GRC.2011.6122687

M3 - Conference contribution

AN - SCOPUS:84863047202

SN - 9781457703713

T3 - Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011

SP - 723

EP - 727

BT - Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011

ER -

Wang SL, Tsai YC, Kao H-Y, Hong TP. K-anonymity on sensitive transaction items. In Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011. 2011. p. 723-727. 6122687. (Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011). https://doi.org/10.1109/GRC.2011.6122687