On the mixing time of directed social graphs and security implications

Authors:
Abedelaziz Mohaisen;Huy Tran;Nicholas Hopper;Yongdae Kim
Affiliations:
University of Minnesota -- Twin Cities, Minneapolis, MN;University of Minnesota -- Twin Cities, Minneapolis, MN;University of Minnesota -- Twin Cities, Minneapolis, MN;University of Minnesota -- Twin Cities, Minneapolis, MN
Venue:
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Year:
2012

Citing 2
Cited 3

SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks

SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
Anonymity in the wild: mixes on unstructured networks

PET'07 Proceedings of the 7th international conference on Privacy enhancing technologies

Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships

Proceedings of the sixth ACM international conference on Web search and data mining
Trustworthy distributed computing on social networks

Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security
Dynamix: anonymity on dynamic social structures

Proceedings of the 8th ACM SIGSAC symposium on Information, computer and communications security

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many graphs in general, and social graphs in particular, are directed by nature. However, applications built on top of social networks, including Sybil defenses, information routing and dissemination, and anonymous communication require mutual relationships which produce undirected graphs. When undirected graphs are used as testing tools for these applications to bring insight on their usability and potential deployment, directed graphs are converted into undirected graphs by omitting edge directions or by augmenting graphs. Unfortunately, it is unclear how altering these graphs affects the quality of their mixing time. Motivated by the lack of prior work on this problem, we investigate mathematical tools for measuring the mixing time of directed social graphs and its associated error bounds. We use these tools to measure the mixing time of several benchmarking directed graphs and their undirected counterparts. We then measure how this difference impacts two applications built on top of social networks: a Sybil defense mechanism and an anonymous communication system.