Abedelaziz Mohaisen
ABSTRACT
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networks are fast mixing, and many recently proposed designs of such systems make crucial use of this property. However, whether real-world social networks are really fast mixing is not verified before, and this could potentially affect the performance of such systems based on the fast mixing property. To address this problem, we measure the mixing time of several social graphs, the time that it takes a random walk on the graph to approach the stationary distribution of that graph, using two techniques. First, we use the second largest eigenvalue modulus which bounds the mixing time. Second, we sample initial distributions and compute the random walk length required to achieve probability distributions close to the stationary distribution. Our findings show that the mixing time of social graphs is much larger than anticipated, and being used in literature, and this implies that either the current security systems based on fast mixing have weaker utility guarantees or have to be less efficient, with less security guarantees, in order to compensate for the slower mixing.
- L. Bilge, T. Strufe, D. Balzarotti, and E. Kirda. All your contacts are belong to us: automated identity theft attacks on social networks. In WWW '09: Proceedings of the 18th international conference on World wide web, pages 551--560, New York, NY, USA, 2009. ACM. Google Scholar
Digital Library
- E. M. Daly and M. Haahr. Social network analysis for routing in disconnected delay-tolerant manets. In MobiHoc'07: Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing, pages 32--40, New York, NY, USA, 2007. ACM. Google ScholarDigital Library
- G. Danezis and P. Mittal. SybilInfer: Detecting sybil nodes using social networks. In The 16th Annual Network & Distributed System Security Conference, 2009.Google Scholar
- J. R. Douceur. The sybil attack. In IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems, pages 251--260, London, UK, 2002. Springer-Verlag. Google ScholarDigital Library
- C. Dwyer, S. Hiltz, and K. Passerini. Trust and privacy concern within social networking sites: A comparison of Facebook and MySpace. In Proceedings of AMCIS, 2007.Google Scholar
- M. Jerrum and A. Sinclair. Conductance and the rapid mixing property for markov chains: the approximation of the permanent resolved (preliminary version). In STOC, pages 235--244. ACM, 1988. Google ScholarDigital Library
- H. A. Kautz, B. Selman, and M. A. Shah. Referral web: Combining social networks and collaborative filtering. Commun. ACM, 40(3):63--65, 1997. Google ScholarDigital Library
- J. Leskovec, D. P. Huttenlocher, and J. M. Kleinberg. Predicting positive and negative links in online social networks. In M. Rappa, P. Jones, J. Freire, and S. Chakrabarti, editors, WWW, pages 641--650. ACM, 2010. Google ScholarDigital Library
- J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In KDD '05: Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, pages 177--187, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- J. Leskovec, K. J. Lang, A. Dasgupta, and M. W. Mahoney. Community structure in large networks: Natural cluster sizes and the absence of large well-defined clusters. CoRR,abs/0810.1355, 2008.Google Scholar
- C. Lesniewski-Laas. A Sybil-proof one-hop DHT. In Proceedings of the 1st workshop on Social network systems, pages 19--24. ACM, 2008. Google ScholarDigital Library
- C. Lesniewski-Lass and M. F. Kaashoek. Whanau: A sybil-proof distributed hash table. In 7th USENIX Symposium on Network Design and Implementation, pages 3--17, 2010. Google ScholarDigital Library
- M. Ley. The DBLP computer science bibliography: Evolution, research issues, perspectives. In String Processing and Information Retrieval, pages 481--486. Springer, 2009. Google ScholarDigital Library
- A. Mislove, M. Marcon, P. K. Gummadi, P. Druschel, and B. Bhattacharjee. Measurement and analysis of online social networks. In Internet Measurement Comference, pages 29--42, 2007. Google ScholarDigital Library
- A. Mohaisen, N. Hopper, and Y. Kim. Designs to account for trust in social network-based sybil defenses. In 17th ACM Conference on Computer and Communications Security, Chicago, IL, USA, 2010. ACM. Google ScholarDigital Library
- A. Mohaisen, N. Hopper, and Y. Kim. Keep your friends close: Incorporating trust in social network-based Sybil defenses. Technical report, University of Minnesota, 2010.Google Scholar
- A. Mohaisen, A. Yun, and Y. Kim. Measuring the mixing time of social graphs. Technical report, University of Minnesota, 2010.Google Scholar
- S. Nagaraja. Anonymity in the wild: Mixes on unstructured networks. In N. Borisov and P. Golle, editors, Privacy Enhancing Technologies, volume 4776 of Lecture Notes in Computer Science, pages 254--271. Springer, 2007. Google ScholarDigital Library
- D. Quercia and S. Hailes. Sybil attacks against mobile users: friends and foes to the rescue. In INFOCOM'10: Proceedings of the 29th conference on Information communications, pages 336--340, Piscataway, NJ, USA, 2010. IEEE Press. Google ScholarDigital Library
- M. Richardson, R. Agrawal, and P. Domingos. Trust management for the semantic web. In D. Fensel, K. P. Sycara, and J. Mylopoulos, editors, International Semantic Web Conference, volume 2870 of Lecture Notes in Computer Science, pages 351--368. Springer, 2003.Google Scholar
- A. Sinclair. Improved bounds for mixing rates of markov chains and multicommodity flow. Combinatorics, Probability & Computing, 1:351--370, 1992.Google ScholarCross Ref
- N. Tran, J. Li, L. Subramanian, and S. S. M. Chow. Brief announcement: improving social-network-based Sybil-resilient node admission control. In A. W. Richa and R. Guerraoui, editors, PODC, pages 241--242. ACM, 2010. Google ScholarDigital Library
- N. Tran, B. Min, J. Li, and L. Subramanian. Sybil-resilient online content voting. In USENIX NSDI, 2009. Google ScholarDigital Library
- E. Vasserman. Towards freedom of speech on the Internet: Censorship-resistant communication and storage. PhD thesis, UNIVERSITY OF MINNESOTA, 2010. Google ScholarDigital Library
- E. Vasserman, R. Jansen, J. Tyra, N. Hopper, and Y. Kim. Membership-concealing overlay networks. In Proceedings of the 16th ACM conference on Computer and communications security, pages 390--399. ACM, 2009. Google ScholarDigital Library
- B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. In Proceedings of the 2nd ACM SIGCOMM Workshop on Social Networks (WOSN'09), August 2009. Google ScholarDigital Library
- B. Viswanath, A. Post, K. P. Gummadi, and A. Mislove. An analysis of social network-based sybil defenses. In SIGCOMM, 2010. Google ScholarDigital Library
- C. Wilson, B. Boe, A. Sala, K. P. Puttaswamy, and B. Y. Zhao. User interactions in social networks and their implications. In EuroSys '09: Proceedings of the 4th ACM European conference on Computer systems, pages 205--218, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- S. Xu, X. Li, and P. Parker. Exploiting social networks for threshold signing: attack-resilience vs. availability. In ASIACCS '08: Proceedings of the 2008 ACM symposium on Information, computer and communications security, pages 325--336, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. SybilLimit: A near-optimal social network defense against sybil attacks. In IEEE Symposium on Security and Privacy, pages 3--17, 2008. Google ScholarDigital Library
- H. Yu, M. Kaminsky, P. B. Gibbons, and A. Flaxman. SybilGuard: defending against sybil attacks via social networks. In SIGCOMM, pages 267--278, 2006. Google ScholarDigital Library
- H. Yu, M. Kaminsky, P. B. Gibbons, and A. D. Flaxman. SybilGuard: defending against sybil attacks via social networks. IEEE/ACM Trans. Netw., 16(3):576--589, 2008. Google ScholarDigital Library
Index Terms
- Measuring the mixing time of social graphs
Recommendations
Understanding Social Networks Properties for Trustworthy Computing
ICDCSW '11: Proceedings of the 2011 31st International Conference on Distributed Computing Systems WorkshopsThe ever-increasing popularity of social networks opens new directions for leveraging social networks to build primitives for security and communication, in many contexts. Such primitives utilize the trust in these social networks to ensure ...
Improving Social Network-Based Sybil Defenses by Rewiring and Augmenting Social Graphs
WISA 2013: Revised Selected Papers of the 14th International Workshop on Information Security Applications - Volume 8267Recent solutions to defend against the Sybil attack, in which a node generates multiple identities, using social networks. In these solutions, social networks are assumed to be fast mixing, and Sybil nodes–which disrupt the fast mixing property of ...
On the mixing time of geographical threshold graphs
We study the mixing time of random graphs in the d-dimensional toric unit cube [0,1]^d generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, ...
Comments