.png){kind=icon}
返回
Hiding in Temporal Networks
.png){kind=icon}
OA
AI
DOI：10.1109/TNSE.2022.3148752.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Social network analysis tools can infer various attributes just by scrutinizing one's connections. Several researchers have studied the problem faced by an evader whose goal is to strategically rewire their social connections in order to mislead such tools, thereby concealing their private attributes. However, to date this literature has only considered static networks, while neglecting the more general case of temporal networks, where the structure evolves over time. Driven by this observation, we study how the evader can conceal their importance from an adversary armed with temporal centrality measures. We consider computational and structural aspects of this problem: Is it computationally feasible to calculate optimal ways of hiding? If it is, what network characteristics facilitate hiding? This topic has been studied in static networks, but in this work, we add realism to the problem by considering temporal networks of edges changing in time. We find that it is usually computationally infeasible to find the optimal way of hiding. On the other hand, by manipulating one's contacts, one could add a surprising amount of privacy. Compared to static networks, temporal networks offer more strategies for this type of manipulation and are thus, to some extent, easier to hide in.
Keyword:
Social networking (online)
Privacy
Time measurement
Licenses
Approximation algorithms
Optimization
Network analyzers
Computational complexity
social media
misinformation
network centrality
network theory
期刊
I
IF:
7.9
论文数:
2.6K
被引数:
10.0K
机构
引用论文
分享收藏Quantifying social contacts in a household setting of rural Kenya using wearable proximity sensors使用可穿戴式接近传感器量化肯尼亚农村家庭中的社交联系.png)
EPJ DATA SCIENCE
OAAI
EPJ DATA SCIENCEIF2.5
OAAI分享收藏
查看更多内容