BSGI: An Effective Algorithm towards Stronger l-Diversity

DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS(2008)

引用 12|浏览0
暂无评分
摘要
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 laccording to certain dataset. Extensive experimental evaluation shows that Unique Distinct l-diversity provides much better protection than conventional l-diversity models, and BSGIgreatly outperforms the state of the art in terms of both efficiency and data quality.
更多
查看译文
关键词
certain privacy,unique distinct l-diversity,effective algorithm,stronger l-diversity,better privacy protection,stronger l-diversity model,certain dataset,better protection,accepted privacy,conventional l-diversity model,privacy disclosure,certain constraint,satisfiability,data quality
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要