首页    期刊浏览 2024年11月28日 星期四
登录注册

文章基本信息

  • 标题:Certain Investigations on Approaches for Protecting Graph Privacy in Data Anonymization
  • 本地全文:下载
  • 作者:S.Charanyaa ; T.Shanmugapriya
  • 期刊名称:International Journal of Innovative Research in Computer and Communication Engineering
  • 印刷版ISSN:2320-9798
  • 电子版ISSN:2320-9801
  • 出版年度:2013
  • 卷号:1
  • 期号:8
  • 出版社:S&S Publications
  • 摘要:Developing privacy preserving mechanisms for data sharing across network for research purposes andbusiness decisions has become one of the issues of the days research interest. L.Sweeney et.al., (2002) [26] developedthe concept of k-anonymity, a model for protecting privacy which poses the condition that a database to be kanonymous,then each record is indistinguishable from at least k-1 other records with respect to their quasi-identifiers.Despite the k-anonymity model, an intruder may gain access the sensitive information if a set of nodes share similarattributes. In this paper we systematically analyze the pure structure anonymization mechanisms and models proposedin the literature. Also we make a detailed study on k-degree-l-diversity anonymity model, which takes intoconsideration the structural information and sensitive labels of individuals as well. Also the study the algorithmicimpact of adding noise nodes to original graph and the rigorous analyses on the theoretical limitations of the appendednoise nodes and its impact.
  • 关键词:Sensitive information; k-anonymity; l-diversity; Database Privacy; Security
国家哲学社会科学文献中心版权所有