TY - GEN
T1 - Optimal Active social Network De-anonymization Using Information Thresholds
AU - Shirani, Farhad
AU - Garg, Siddharth
AU - Erkip, Elza
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - In this paper, de-anonymizing internet users by actively querying their group memberships in social networks is considered. An anonymous victim visits the attacker's website, and the attacker uses the victim's browser history to query her social media activity for the purpose of de-anonymization using the minimum number of queries. A stochastic model of the problem is considered where the attacker has partial prior knowledge of the group membership graph and receives noisy responses to its real-time queries. The victim's identity is assumed to be chosen randomly based on a given distribution which models the users' risk of visiting the malicious website. A de-anonymization algorithm is proposed which operates based on information thresholds and its performance both in the finite and asymptotically large social network regimes is analyzed. Furthermore, a converse result is provided which proves the optimality of the proposed attack strategy.
AB - In this paper, de-anonymizing internet users by actively querying their group memberships in social networks is considered. An anonymous victim visits the attacker's website, and the attacker uses the victim's browser history to query her social media activity for the purpose of de-anonymization using the minimum number of queries. A stochastic model of the problem is considered where the attacker has partial prior knowledge of the group membership graph and receives noisy responses to its real-time queries. The victim's identity is assumed to be chosen randomly based on a given distribution which models the users' risk of visiting the malicious website. A de-anonymization algorithm is proposed which operates based on information thresholds and its performance both in the finite and asymptotically large social network regimes is analyzed. Furthermore, a converse result is provided which proves the optimality of the proposed attack strategy.
UR - http://www.scopus.com/inward/record.url?scp=85052464346&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85052464346&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437739
DO - 10.1109/ISIT.2018.8437739
M3 - Conference contribution
AN - SCOPUS:85052464346
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1445
EP - 1449
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
Y2 - 17 June 2018 through 22 June 2018
ER -