On the mixing time of directed social graphs and security implications

ASIACCS 2012 - 7th ACM Symposium on Information, Computer and Communications Security

Volumn , Issue , 2012, Pages 36-37

  Mohaisen, Abedelaziz ^a   Tran, Huy ^a   Hopper, Nicholas ^a   Kim, Yongdae ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANONYMOUS COMMUNICATION; ANONYMOUS COMMUNICATION SYSTEMS; AUGMENTING GRAPH; DEFENSE MECHANISM; EDGE DIRECTION; ERROR BOUND; INFORMATION ROUTING; MATHEMATICAL TOOLS; MIXING TIME; SECURITY IMPLICATIONS; SOCIAL GRAPHS; SOCIAL NETWORKS; TESTING TOOLS; UNDIRECTED GRAPH;

COMMUNICATION SYSTEMS; ERROR ANALYSIS; GRAPHIC METHODS; INFORMATION DISSEMINATION; MIXING; SECURITY OF DATA; SOCIAL NETWORKING (ONLINE);

DIRECTED GRAPHS;

EID: 84871985239     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2414456.2414476     Document Type: Conference Paper

References (5)

1. A. Granas and J. Dugundji. Fixed point theory. Springer Verlag, 2003.
2. A. Mohaisen, H. Tran, N. Hopper, and Y. Kim. On the mixing time of directed social graphs. Technical report, University of Minnesota, 2011.
3. S. Nagaraja. Anonymity in the wild. In Proc. of PETS. Springer, 2007.
4. A. Sinclair. Improved bounds for mixing rates of mc and multicommodity flow. Comb., Prob. & Comp., 1992.
5. H. Yu, P. B. Gibbons, M. Kaminsky, and F. Xiao. SybilLimit: A near-optimal social net defense against sybil attacks. In Proc. of Symposium on Security and Privacy. IEEE, 2008.