期刊文献+

基于进化算法的社会网络数据k-匿名发布 被引量:2

Evolutionary Algorithm for Social Network Data Publication Based on k-anonymity
下载PDF
导出
摘要 基于科学发展的需要,越来越多的社会网络数据被共享发布。为保证发布数据中个体的隐私不被泄露,必须将数据进行隐私保护后发布。针对结点度的再识别攻击,提出一种改进的进化算法对社会网络发布的数据进行k-度匿名(CEAGA),将EAGA算法中的适应度函数与循环结束条件进行改进,得到最优的k-度匿名序列,之后按照得到的k-度匿名序列对匿名图进行构造,得到最优的k-度匿名社会网络图。实验结果表明,改进后的进化算法不但降低了对原社会网络图的修改,并且对图结构性质的保持也优于EAGA算法。 Based on the needs of scientific development, a growing number of social network data to be shared and released. In order to ensure that the privacy of the individual "s privacy is not leaked, privacy protection should be carried on before releasing social networks data. For re-identification attack of the node degree, we pro- posed an improved evolutionary algorithm that to carry out the k-degree anonymity for social networks data. This paper improved fitness function and end condition of the loop of EAGA algorithm , and obtained optimal k-degree anonymous sequence. Then we obtained the optimal anonymous social network graph of k-degree by construct a- nonymous graph based on k-degree anonymous sequence that previous algorithms was generated. Experimental re- suits show that the improved evolutionary algorithm not only reduces the modification of the original social network graph, keep the property of the graph structure is better than EAGA algorithms.
出处 《贵州大学学报(自然科学版)》 2016年第1期89-93,共5页 Journal of Guizhou University:Natural Sciences
基金 贵州省基础研究重大项目资助(黔科合JZ字[2014]2001)
关键词 社会网络 隐私保护 进化算法 k-度匿名 图结构性质 social network privacy protection evolutionary algorithm k- degree anonymous property of thegraph structure
  • 相关文献

参考文献13

  • 1WANG Y, XIE L, ZHENG B, et al. Utitily- Oritented k- anony- mization on social network[ C]//Proc of the 16th Int'l Conf On- Database Systems for Advanced Application, Hong Kong, China: DASFAA, 2011:78-92.
  • 2LIU K, TERZI E.Towards Identity Anonymization on Graphs [ C ]// Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, Vancouver, Canada : ACM , 2008 : 93-106.
  • 3ZHOU B, PEI J.Preserving privacy in social networks against neigh- borhood attacks [ C ]//Proceedings of the 24th IEEE International Conference on Data Engineering ( ICDE "08 ), Cancun, Mexico: IEEE Computer Society, 2008 : 506-515.
  • 4ZHOU B, PEI J. The k- anonymity and 1- diversity approaches forprivacy preservation in social networks against neighborhood attacks[J].Knowledge and Information System,2011,28( 1 ) :47-77.
  • 5张伟,王旭然,王珏,陈云芳.基于k-邻域同构的动态社会网络隐私保护方法[J].南京邮电大学学报(自然科学版),2014,34(5):9-16. 被引量:11
  • 6ZOU L, CHEN L, OZSU M T. k-automorphism: a general frame- work for privacy preserving graph publication [ C ]// Proc of the VLDB Endowment, Lyon ,France: ACM,2009:946-954.
  • 7A Campan, T M Truta. Data and structural k-anonymity in social graphs [ J ].Lecture Notes in Computer Science, 2008,5456 : 33- 54.
  • 8Jordi Casas-Roma, Jordi Herrera-Joancomarti, Vicena Torra. Evo- lutionary Algorithm for Graph Anonymization[ DB/OL]. (2014-03 -26).http ://arxiv.org/pdf/1310.0229v2.pdf.
  • 9D E Knuth.The Stanford GraphBase: A Platform for Combinatorial Computing[ M]. Boston:Addison-Wesley Professional, 1993.
  • 10CHENG J, FU A W, LIU J. K- isomorphism: Privacy Preserving Network Publication Against Structural Attacks [ C ] //Proceedings of the 2010 International Conference on Management of Data, In- dianapolis, USA : ACM,2010:459-470.

二级参考文献31

  • 1杨晓春,刘向宇,王斌,于戈.支持多约束的K-匿名化方法[J].软件学报,2006,17(5):1222-1231. 被引量:60
  • 2Sweeney L. k-anonymity.. A model for protecting privacy[J]. International Journal on Uncertainty, Fuzziness and Knowledge- Based Systems, 2002,10(5) : 557-570.
  • 3Maehanavajjhala A, Gehrke J, Kifer D, et al. 1-diversity: Privacy beyond k-anonymity[J]. ACM Transactions on Knowledge Discovery from Data, 2007,1 (1) : 24-35.
  • 4Li N, Li T. t-closeness:Privacy beyond k-anonymity and 1-diversity[C]//Proc, of the 23rd International Conference on Data Engineering. Istanbul: IEEE, 2007 : 106-115.
  • 5Mislove A, Marcon M, Krishna P, et al. Measurement and Analysis of Online Social Networks[C]//Proc. of IMC' 07. New York: ACM, 2007 :29- 41.
  • 6Albert R,Jeong H,Barabasi A L. Error and attack tolerance of complex networks[J]. Nature, 2600,406 : 378-382.
  • 7Hay M, Miklau G, J ensen D, et al. Anonymizing social networks [R]. 07-19. University of Massachusetts Amherst,2007.
  • 8Zheleva E, Getoor L. Preserving the privacy of sensitive relationships in graph data[C]//Proc, of the 1st ACM SIGKDD Work shop on Privacy, Security, and Trust in KDD. Berlin: ACM, 2007: 153- 171.
  • 9Campan 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. Las Vegas: ACM, 2008: 93-104.
  • 10Liu L, Wang J, Liu J, et al. Privacy preserving in social networks against sensitive edge disclosure[R]. CMIDA-HiPSCCS 006-08. Department of Computer Science, University of Kentucky, 2008.

共引文献14

同被引文献22

引证文献2

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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