期刊
KNOWLEDGE AND INFORMATION SYSTEMS
卷 28, 期 3, 页码 645-663出版社
SPRINGER LONDON LTD
DOI: 10.1007/s10115-010-0353-5
关键词
Link privacy; Randomization; Social networks; Similarity measures
资金
- U.S. National Science Foundation [IIS-0546027, CNS-0831204]
- Division Of Computer and Network Systems
- Direct For Computer & Info Scie & Enginr [0831204] Funding Source: National Science Foundation
Many applications of social networks require relationship anonymity due to the sensitive, stigmatizing, or confidential nature of relationship. Recent work showed that the simple technique of anonymizing graphs by replacing the identifying information of the nodes with random IDs does not guarantee privacy since the identification of the nodes can be seriously jeopardized by applying subgraph queries. In this paper, we investigate how well an edge-based graph randomization approach can protect sensitive links. We show via theoretical studies and empirical evaluations that various similarity measures can be exploited by attackers to significantly improve their confidence and accuracy of predicted sensitive links between nodes with high similarity values. We also compare our similarity measure-based prediction methods with the low-rank approximation-based prediction in this paper.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据