社会网络数据的三级隐私保护发布算法研究  

Three Level Privacy Protection in Social Networks

作　　者：张蕊[1,2] 瞿彬彬[1] 张吉昕[2] 

机构地区：[1]华中科技大学计算机学院,武汉430070 [2]武汉理工大学计算机学院,武汉430070

出　　处：《计算机科学》2012年第4期164-167,188,共5页Computer Science

基　　金：国家自然科学基金(60803130)资助

摘　　要：近年来,社会网络中的隐私保护得到了诸多关注。攻击者可以应用相关背景知识对发布的社会网络进行攻击,从而导致用户的隐私被泄露。已有工作通常只考虑了结点泄露和边泄露的情况,而忽略了攻击者可能通过识别用户的敏感信息来进行攻击。针对现有问题,提出了特征泄露的概念,并进行了理论分析。在此基础上,创造性地提出了三级隐私保护的概念,建立了隐私保护模型k-s图,并给出了k-s算法来生成k-s图。理论分析和实验结果表明,k-s算法是正确有效的。Serious concerns on privacy protection in social networks have been raised in recent years.When an adversary uses some types of background knowledge to conduct an attack,an individual＇s privacy may be threatened.In pioneer work,node disclosure and edge disclosure were studied.However,there is little effort to deal with sensitivity disclosure.To address it,sensitivity disclosure was formally defined and theoretically analyzed.Taking into account all these disclosures,three level privacy protection was proposed,and k-s graph was presented as the solution.To generate k-s graph,k-salgorithm is both theoretically correct and experimentally effective.

关 键 词：数据发布 社会网络 三级隐私保护 特征泄露 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]