期刊文献+

抵制多敏感属性关联攻击的(l,m)-多样性模型 被引量:6

A(l,m)-Diversity Model of Resisting the Associated Attack on Multi-sensitive Attributes
在线阅读 下载PDF
导出
摘要 现有的微数据发布隐私保护匿名模型均没有考虑敏感属性间的关联关系,不能抵制基于敏感属性间关系的攻击.为此,论文提出抵制敏感属性关联攻击的(l,m)-多样性模型,该模型要求匿名数据的每个等价类中,每维敏感属性上多样性至少为l,并且当某一敏感值从等价类中删除后,该等价类剩下的敏感值仍满足(l-1,m)-多样性.本文也提出了实现(l,m)-多样性的两个算法—BottomUp算法和TopDown算法.实验表明,所提出的算法均能实现面向多敏感属性的(l,m)-多样性模型,有效保护多敏感属性微数据的个体隐私. Existing anonymity models for publishing microdata do not capture the relationship of sensitive attributes and cannot resist the attack based on the relation of sensitive attributes. To address the problem, the paper proposes a (l,m) -diversity model to resist the associated attack on sensitive attributes. The model requests that in each equivalence class, the diversity of each sensitive attribute is at least l and when one sensitive values are deleted, the rest of sensitive values still satisfy (l-1 ,m)-diversity. The paper also pro- poses two algorithms to implement the (l, m)-diversity model--BottomUp algorithm and TopDown algorithm. Experimental results show that the proposed algorithms can implement the (l, m)-diversity model and preserve privacy on publishing microdata with multi- sensitive attributes effectively.
出处 《小型微型计算机系统》 CSCD 北大核心 2013年第6期1387-1391,共5页 Journal of Chinese Computer Systems
基金 国家自然科学基金项目(61170108 6110019)资助 浙江省自然科学基金项目(Y1100161 12YJCZH142)资助 教育部人文社科研究项目(12YJCZH142)资助
关键词 微数据 多敏感属性 关联攻击 (l m)-多样性 microdata multi-sensitive attributes associated attack ( l, m) -diversity
  • 相关文献

参考文献2

二级参考文献33

  • 1杨晓春,刘向宇,王斌,于戈.支持多约束的K-匿名化方法[J].软件学报,2006,17(5):1222-1231. 被引量:60
  • 2Samarati P. Protecting respondents' identities in microdata release [J]. IEEE Trans on Knowledge and Data Engineering, 2001,13(6): 1010-1027.
  • 3Samarati P, Sweeney L. Protecting privacy when disclosing information: k-anonymity and its enforcement through generalization and suppression [R]. Technical Report SRI-CSL-98-04, SRI Computer Science Laboratory, 1998.
  • 4Sweeney L. K-anonymity: a model for protecting privacy [J]. International Journal on Uncertainty, Fuzziness and Knowledge based Systems, 2002,10 (5): 557-570.
  • 5Machanavajjhala A, Gehrke J, Kefer D. l-diversity: privacy beyond k-anonymity [C] //Proceedings of the 22nd International Conference on Data Engineering, Atlanta, 2006: 24.
  • 6Meyerson A,Williarns R.On the complexity of optimal k-anonymity [C] //Proc of PODS, New York, 2004: 223-228.
  • 7AggarwaL G, Feder T, Kenthapadi K, et al.. k-anonymity: algorithms and hardness [R] //Stanford University, 2004:124-135.
  • 8LeFevre K, DeWitt D J, Ramakrishnan R. Incognito: efficient full-domain k-anonymity [C] //ACM SIGMOD International Conference on Management of Data, Baltimore, 2005: 49-60.
  • 9Lefevre K, Dewitt D, Ramakrishnan R. Mondrian multidimensional k-anonymity [C] //Proceedings of the 22nd International Conference on Data Engineering, Atlanta, 2006: 25.
  • 10Samarati P, Sweeney L. Generalizing data to provide anonymity when disclosing information [C] //Proc of the 17th ACMSIGMODSIGAC-SIGART Symposium on the Principles of Database Systems, Seattle, 1998: 188.

共引文献60

同被引文献29

引证文献6

二级引证文献28

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部