Understanding Social Networks Properties for Trustworthy Computing
暂无分享,去创建一个
[1] Michael Ley,et al. The DBLP Computer Science Bibliography: Evolution, Research Issues, Perspectives , 2002, SPIRE.
[2] Aziz Mohaisen,et al. Measuring the mixing time of social graphs , 2010, IMC '10.
[3] Daniele Quercia,et al. Sybil Attacks Against Mobile Users: Friends and Foes to the Rescue , 2010, 2010 Proceedings IEEE INFOCOM.
[4] Alistair Sinclair,et al. Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow , 1992, Combinatorics, Probability and Computing.
[5] Krishna P. Gummadi,et al. You are who you know: inferring user profiles in online social networks , 2010, WSDM '10.
[6] Jure Leskovec,et al. Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..
[7] Krishna P. Gummadi,et al. Measurement and analysis of online social networks , 2007, IMC '07.
[8] Michael Kaminsky,et al. SybilGuard: defending against sybil attacks via social networks , 2006, SIGCOMM.
[9] Chandra Prakash,et al. SybilInfer: Detecting Sybil Nodes using Social Networks , 2011 .
[10] Hector Garcia-Molina,et al. DHT Routing Using Social Links , 2004, IPTPS.
[11] Aziz Mohaisen,et al. Keep your friends close: Incorporating trust into social network-based Sybil defenses , 2011, 2011 Proceedings IEEE INFOCOM.
[12] Krishna P. Gummadi,et al. An analysis of social network-based Sybil defenses , 2010, SIGCOMM 2010.
[13] M. Frans Kaashoek,et al. Whanau: A Sybil-proof Distributed Hash Table , 2010, NSDI.
[14] Christos Faloutsos,et al. Graphs over time: densification laws, shrinking diameters and possible explanations , 2005, KDD '05.
[15] Ben Y. Zhao,et al. User interactions in social networks and their implications , 2009, EuroSys '09.
[16] Jure Leskovec,et al. Predicting positive and negative links in online social networks , 2010, WWW '10.
[17] Lakshminarayanan Subramanian,et al. Sybil-Resilient Online Content Voting , 2009, NSDI.
[18] Shishir Nagaraja,et al. Anonymity in the Wild: Mixes on Unstructured Networks , 2007, Privacy Enhancing Technologies.
[19] Aziz Mohaisen,et al. Mistaking friends for foes: an analysis of a social network-based Sybil defense in mobile networks , 2011, ICUIMC '11.
[20] Vladimir Batagelj,et al. An O(m) Algorithm for Cores Decomposition of Networks , 2003, ArXiv.
[21] Alistair Sinclair,et al. Improved Bounds for Mixing Rates of Marked Chains and Multicommodity Flow , 1992, LATIN.
[22] Mads Haahr,et al. Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.
[23] Thomas E. Anderson,et al. Privacy-preserving P2P data sharing with OneSwarm , 2010, SIGCOMM '10.
[24] Lakshminarayanan Subramanian,et al. Optimal Sybil-resilient node admission control , 2011, 2011 Proceedings IEEE INFOCOM.
[25] Matthew Richardson,et al. Trust Management for the Semantic Web , 2003, SEMWEB.
[26] Feng Xiao,et al. SybilLimit: A Near-Optimal Social Network Defense Against Sybil Attacks , 2010, IEEE/ACM Trans. Netw..
[27] Matteo Dell Amico. A Measurement of Mixing Time in Social Networks , 2009 .
[28] George Danezis,et al. Sybil-Resistant DHT Routing , 2005, ESORICS.