保护K-Core的大规模社交网络隐私保护方法

Jian Li, Xiaolin Zhang, Jiao Liu, Gao Lu, Huanxiang Zhang, Yu Feng
{"title":"保护K-Core的大规模社交网络隐私保护方法","authors":"Jian Li, Xiaolin Zhang, Jiao Liu, Gao Lu, Huanxiang Zhang, Yu Feng","doi":"10.6633/IJNS.202107_23(4).07","DOIUrl":null,"url":null,"abstract":"Social network analysis has many important applications and methods which depend on the sharing and publishing of graphs. For example, link privacy requires limiting the probability of an adversary identifying a target sensitive link between two individuals in the published social network graph. However, the existing link privacy protection methods have low processing power for large-scale graph data and less consideration of community protection in the publishing graphs. Therefore, aiming at sensitive link privacy protection, a large-scale social network privacy protection model to protect K-Core (PPMPK) was proposed. The large-scale social network graph was processed to ensure that the core number and the community structure of the nodes were unchanged based on the Pregel parallel graph processing model. Extensive experiments on the real data sets showed that the proposed method could effectively process the large-scale graph data and protect the data availability of the published graphs, especially in community protection.","PeriodicalId":93303,"journal":{"name":"International journal of network security & its applications","volume":"20 1","pages":"612-622"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Large-Scale Social Network Privacy Protection Method for Protecting K-Core\",\"authors\":\"Jian Li, Xiaolin Zhang, Jiao Liu, Gao Lu, Huanxiang Zhang, Yu Feng\",\"doi\":\"10.6633/IJNS.202107_23(4).07\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Social network analysis has many important applications and methods which depend on the sharing and publishing of graphs. For example, link privacy requires limiting the probability of an adversary identifying a target sensitive link between two individuals in the published social network graph. However, the existing link privacy protection methods have low processing power for large-scale graph data and less consideration of community protection in the publishing graphs. Therefore, aiming at sensitive link privacy protection, a large-scale social network privacy protection model to protect K-Core (PPMPK) was proposed. The large-scale social network graph was processed to ensure that the core number and the community structure of the nodes were unchanged based on the Pregel parallel graph processing model. Extensive experiments on the real data sets showed that the proposed method could effectively process the large-scale graph data and protect the data availability of the published graphs, especially in community protection.\",\"PeriodicalId\":93303,\"journal\":{\"name\":\"International journal of network security & its applications\",\"volume\":\"20 1\",\"pages\":\"612-622\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of network security & its applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.6633/IJNS.202107_23(4).07\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of network security & its applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.6633/IJNS.202107_23(4).07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

社会网络分析有许多重要的应用和方法都依赖于图表的共享和发布。例如,链接隐私要求限制攻击者在公开的社交网络图中识别两个个体之间的目标敏感链接的概率。然而,现有的链路隐私保护方法对大规模图数据的处理能力较低,并且在发布图时较少考虑社区保护。因此,针对敏感链接隐私保护,提出了一种保护K-Core的大规模社交网络隐私保护模型(PPMPK)。基于Pregel并行图处理模型,对大规模社交网络图进行处理,保证节点的核数和社区结构不变。在实际数据集上进行的大量实验表明,该方法可以有效地处理大规模图数据,并保护已发布图的数据可用性,特别是在社区保护方面。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Large-Scale Social Network Privacy Protection Method for Protecting K-Core
Social network analysis has many important applications and methods which depend on the sharing and publishing of graphs. For example, link privacy requires limiting the probability of an adversary identifying a target sensitive link between two individuals in the published social network graph. However, the existing link privacy protection methods have low processing power for large-scale graph data and less consideration of community protection in the publishing graphs. Therefore, aiming at sensitive link privacy protection, a large-scale social network privacy protection model to protect K-Core (PPMPK) was proposed. The large-scale social network graph was processed to ensure that the core number and the community structure of the nodes were unchanged based on the Pregel parallel graph processing model. Extensive experiments on the real data sets showed that the proposed method could effectively process the large-scale graph data and protect the data availability of the published graphs, especially in community protection.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信