社交网络中路径节点的匿名化

Wenlue Song, Yan Zhang, Wenyang Bai
{"title":"社交网络中路径节点的匿名化","authors":"Wenlue Song, Yan Zhang, Wenyang Bai","doi":"10.1109/DBTA.2010.5658931","DOIUrl":null,"url":null,"abstract":"Recently, social network privacy becomes a hot issue in the field of privacy. We are concerned about the path nodes in the social network. With the knowledge of the two endpoints of a path, the adversary can attack the privacy of the nodes on this path. In this paper, we define the adversary's background knowledge, propose the anonymity model, and propose PN- Anonymity algorithm to adjust paths. Experimental results show that our algorithms can achieve the path nodes anonymous, and information loss can be well controlled to ensure the availability of information.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Anonymizing Path Nodes in Social Network\",\"authors\":\"Wenlue Song, Yan Zhang, Wenyang Bai\",\"doi\":\"10.1109/DBTA.2010.5658931\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, social network privacy becomes a hot issue in the field of privacy. We are concerned about the path nodes in the social network. With the knowledge of the two endpoints of a path, the adversary can attack the privacy of the nodes on this path. In this paper, we define the adversary's background knowledge, propose the anonymity model, and propose PN- Anonymity algorithm to adjust paths. Experimental results show that our algorithms can achieve the path nodes anonymous, and information loss can be well controlled to ensure the availability of information.\",\"PeriodicalId\":320509,\"journal\":{\"name\":\"2010 2nd International Workshop on Database Technology and Applications\",\"volume\":\"57 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Workshop on Database Technology and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DBTA.2010.5658931\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Workshop on Database Technology and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DBTA.2010.5658931","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

近年来,社交网络隐私成为隐私领域的热点问题。我们关注的是社交网络中的路径节点。通过了解路径的两个端点,攻击者可以攻击该路径上节点的隐私性。本文定义了对手的背景知识,提出了匿名模型,并提出了PN-匿名算法来调整路径。实验结果表明,我们的算法可以实现路径节点匿名,并且可以很好地控制信息丢失,保证信息的可用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Anonymizing Path Nodes in Social Network
Recently, social network privacy becomes a hot issue in the field of privacy. We are concerned about the path nodes in the social network. With the knowledge of the two endpoints of a path, the adversary can attack the privacy of the nodes on this path. In this paper, we define the adversary's background knowledge, propose the anonymity model, and propose PN- Anonymity algorithm to adjust paths. Experimental results show that our algorithms can achieve the path nodes anonymous, and information loss can be well controlled to ensure the availability of information.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信