BSGI: An effective algorithm towards stronger l-diversity

8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

To reduce the risk of privacy disclosure during personal data publishing, the approach of anonymization is widely employed. On this topic, current studies mainly focus on two directions: (1)developing privacy preserving models which satisfy certain constraints, such as k-anonymity, l-diversity, etc.; (2)designing algorithms for certain privacy preserving model to achieve better privacy protection as well as less information loss. This paper generally belongs to the second class. We introduce an effective algorithm "BSGI" for the widely accepted privacy preserving model: l-diversity. In the meantime, we propose a novel interpretation of l-diversity: Unique Distinct l-diversity, which can be properly achieved by BSGI. We substantiate it's a stronger l-diversity model than other interpretations. Related to the algorithm, we conduct the first research on the optimal assignment of parameter l according to certain dataset. Extensive experimental evaluation shows that Unique Distinct l-diversity provides much better protection than conventional l-diversity models, and BSGI greatly outperforms the state of the art in terms of both efficiency and data quality. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ye, Y., Deng, Q., Wang, C., Lv, D., Liu, Y., & Feng, J. (2008). BSGI: An effective algorithm towards stronger l-diversity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5181 LNCS, pp. 19–32). https://doi.org/10.1007/978-3-540-85654-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free