期刊文献+

用二分图实现数据发布的隐私保护 被引量:1

Privacy-preserving data publishing using bipartite graph
下载PDF
导出
摘要 基于表存储而发布的数据虽然可以实现隐私保护,但是由于表中记录相互独立,使得个体间的关联信息在发布中缺失,影响发布数据的效用。提出采用二分图的形式对数据进行发布,将顶点划分为两类,把带有标签的顶点按聚类方法进行分组,根据聚类分组结果对另外一个顶点集进行最大匹配分组,通过隐藏个体和顶点的映射关系,保证两类个体间关系的安全发布。基于聚类的最大匹配分组方法既实现了隐私的保护又增加了发布数据的效用。 It could implement privacy protection based on the table storage and data publication,but the records were independent each other.It made entities relationships miss in the publication and influenced the effectiveness of the publication data.With bipartite graph publishing data,divided the vertexes into two categories.Grouped the vertexes with a label by clustering method.Another vertex set implemented maximum matching group according to it.By hiding mappings between individual and vertex,it ensured relationships between two classes of individual security release.The maximum match group based on the cluster not only realizes the privacy protection but also increases the published data effectiveness.
出处 《计算机应用研究》 CSCD 北大核心 2010年第11期4303-4305,4308,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(60773049) 江苏省科技创新资金资助项目(sbc20080655)
关键词 隐私保护 数据发布 二分图 最大匹配 privacy protection data publication bipartite graph maximum match
  • 相关文献

参考文献10

  • 1SWEENEY L. k-anonymity: a model for protecting privacy[J]. International Journal on Uncertainty, Fuzziness and Knowledge- Based Systems ,2002,10(5 ) :55?-570.
  • 2MACHANAVAJJHALA A,GEHRKE J, KIFER D, et al.l-diversity: privacy beyond k-anonymity [ C ]//Proc of the 22nd International Conference on Data Engineering. New York:ACM Press,2006:24-35.
  • 3LI Ning-hui,LI Tian-theng. t-Closeness: privacy beyond k-anonymity and l-diversity[ C ]//Proc of the 23rd International Conference on Data Engineering. Washington DC : IEEE Computer Society, 2007 ; 106- 115.
  • 4HAY M, MIKLAU G. , JENSEN D, et al. Anonymizing social networks [ R ]. Amberst : University of Massachusetts. 2007.
  • 5ZHELEVA E, GETOOR L. Preserving the privacy of sensitive relationships in graph data[ C ]//Proc of the 1 st ACM SIGKDD Workshop on Privacy, Security, and Trust in KDD. New York: ACM Press, 2007 : 153-171.
  • 6CAMPAN A, TRUTA T M. A clustering approach for data and structural anonymity in social networks[ C]//Proc of the 2nd ACM SIGKDD International Workshop on Privacy, Security, and Trust in KDD. New York : ACM Press ,2008:93-104.
  • 7LIU Lian, WANG Jie, LIU Jin-ze, et al. Privacy preserving in social networks against sensitive edge disclosure, Technical Report CMIDAHiPSCCS [ R ]. Lexington : Department of Computer Science, University of Kentucky ,2008.
  • 8LIU K, TERZI E. Towards identity anonymization on graphs[ C ]// Proc of ACM SIGMOD International Conference on Management of Data. New York :ACM Press,2008:93-106.
  • 9ZHOU B, PEI J. Preserving privacy in social networks against neighborhood attacks [ C ]//Proc of the 24th IEEE International Conference on Data Engineering. Washington DC : IEEE Computer Society, 2008 : 506-515.
  • 10CORMODE G, SRIVASTAVA D, YU T, et al. Anonymizing bipartite graph data using safe groupings [ C ]//Proc of the 34th International Conference on Very Large Databases. Washington DC:IEEE Computer Society, 2008 : 20 - 33.

同被引文献5

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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