Dynamix: Anonymity on dynamic social structures

ASIA CCS 2013 - Proceedings of the 8th ACM SIGSAC Symposium on Information, Computer and Communications Security

Volumn , Issue , 2013, Pages 167-172

  Mohaisen, Abedelaziz ^a   Kim, Yongdae ^b  

^a VeriSign Inc   (United States)

^b Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

Author keywords

anonymity; dynamics; p2p communication; social networks

Indexed keywords

ANONYMITY; GRAPH STRUCTURES; MEASUREMENTS OF; P2P COMMUNICATIONS; SENDER ANONYMITY; SOCIAL NETWORKS; SOCIAL STRUCTURE; STATIC STRUCTURES;

COMMUNICATION; DYNAMICS; SECURITY OF DATA; SOCIAL NETWORKING (ONLINE);

GRAPHIC METHODS;

EID: 84877937276     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2484313.2484334     Document Type: Conference Paper

References (20)

1. U. Acer, P. Drineas, and A. Abouzeid. Random walks in time-graphs. In WMON. ACM, 2010.
2. B. Bollobás. Modern graph theory, volume 184. Springer, 1998.
3. E. M. Daly and M. Haahr. Social network analysis for routing in disconnected delay-tolerant manets. In MobiHoc, 2007.
4. G. Danezis, C. Díaz, C. Troncoso, and B. Laurie. Drac: An architecture for anonymous low-volume communications. In PETS, 2010.
5. M. Gjoka, C. T. Butts, M. Kurant, and A. Markopoulou. Multigraph sampling of online social networks. IEEE JSAC, 2011.
6. P. Hui, J. Crowcroft, and E. Yoneki. Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE TMC, 2011.
7. R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. Link Mining: Algorithms and Apps, 2010.
8. M. Ley. The DBLP computer science bibliography: Evolution, research issues, perspectives. In SPIR, 2009.
9. P. Mittal, M. Wright, and N. Borisov. Pisces: Anonymous communication using social networks. In NDSS, 2013.
10. A. Mohaisen, N. Hopper, and Y. Kim. Incorporating trust into social network-based sybil defenses. In INFOCOM, 2011.
11. A. Mohaisen, H. Tran, N. Hopper, and Y. Kim. Understanding social network properties for trustworthy computing. In SIMPLEX, 2011.
12. A. Mohaisen, H. Tran, N. Hopper, and Y. Kim. On the mixing time of directed social graphs and security implications. In ASIACCS, 2012.
13. A. Mohaisen, A. Yun, and Y. Kim. Measuring the mixing time of social graphs. In IMC, pages 383-389. ACM, 2010.
14. S. Nagaraja. Anonymity in the wild. In PETS, 2007.
15. L. Tang, H. Liu, J. Zhang, and Z. Nazeri. Community evolution in dynamic multi-mode networks. In KDD, 2008.
16. C. Tantipathananandh, T. Berger-Wolf, and D. Kempe. A framework for community ident. in dynamic social networks. In KDD, 2007.
17. H. Tong, S. Papadimitriou, J. Sun, P. Yu, and C. Faloutsos. Colibri: fast mining of large static and dynamic graphs. In KDD, 2008.
18. B. Viswanath, A. Mislove, M. Cha, and K. P. Gummadi. On the evolution of user interaction in facebook. In WOSN, 2009.
19. H. Yu, M. Kaminsky, P. Gibbons, and A. Flaxman. SybilGuard: defending against sybil attacks via social networks. In SIGCOMM, 2006.
20. X. Zhao, A. Sala, C. Wilson, X. Wang, S. Gaito, H. Zheng, and B. Y. Zhao. Multi-scale dynamics in a massive online social network. In IMC, 2012.