Sybil defenses in DHT networks based on social relationships

Download: PDF(1424 KB) HTML
Export: BibTeX | EndNote | Reference Manager | ProCite | RefWorks Supporting Info

Guide

Abstract

The Sybil attack, which creates a large amount of fake node identities to break the normal routing process in the peer-to-peer (P2P) networks, is the main threat faced by distributed networks. A Social-DHT protocol was developed using the properties of social relationships to mitigate Sybil attacks in distributed Hash table (DHT) networks using random walks over the social relationships. In addition, a model is given using a formalized definition to analyze the successful probability of searches. Simulations show that the Social-DHT routing table includes less than 3% of the Sybil nodes when there are 10000 attack edges and the successful search ratio reaches 99%, which is better than existing methods.

Keywords peer-to-peer (P2P) distributed Hash table (DHT) Sybil attack social networks

ZTFLH:

Fund:

Issue Date: 15 January 2014

	Service

	E-mail this article
	E-mail Alert
	RSS
	Articles by authors

	Xinhui HAN
	Xianquan XIAO
	Jianyu ZHANG
	Bingshuang LIU
	Yuan ZHANG

Cite this article:

Xinhui HAN,Xianquan XIAO,Jianyu ZHANG, et al. Sybil defenses in DHT networks based on social relationships[J]. Journal of Tsinghua University(Science and Technology), 2014, 54(1): 1-7.

URL:

http://jst.tsinghuajournals.com/EN/ OR http://jst.tsinghuajournals.com/EN/Y2014/V54/I1/1

[1]	Steinmetz R. Peer-to-Peer Systems and Applications [M]. Berlin, Germany:Springer, 2005.
[2]	Ratnasamy S, Francis P, Handley M, et al.A Scalable Content-Addressable Network [M]. Danvers, USA:Association for Computing Machinery, 2001.
[3]	Rowstron A, Druschel P. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems [C]// Middleware 2001. Berlin, Germany:Springer, 2001: 329-350.
[4]	Stoica I, Morris R, Karger D, et al.Chord: A scalable peer-to-peer lookup service for internet applications [J]. ACM SIGCOMM Computer Communication Review, 2001, 31(4): 149-160. url: http://dx.doi.org/10.1145/964723.383071
[5]	Maymounkov P, Mazieres D. Kademlia: A peer-to-peer information system based on the xor metric [C]// Peer-to-Peer Systems. Berlin, Germany: Springer, 2002: 53-65.
[6]	Douceur J R. TheSybil attack [C]// Peer-to-Peer Systems. Berlin, Germany: Springer, 2002: 251-260.
[7]	Castro M, Druschel P, Ganesh A, et al.Secure routing for structured peer-to-peer overlay networks[J]. ACM SIGOPS Operating Systems Review, 2002, 36(SI): 299-314. url: http://dx.doi.org/10.1145/844128.844156
[8]	WANG Honghao, ZHU Yingwu, HU Yiming. An efficient and secure peer-to-peer overlay network [C]// The IEEE Conference on Local Computer Networks 30th Anniversary. Washington DC, USA: IEEE Press, 2005: 764-771.
[9]	Bazzi R A, Konjevod G. On the establishment of distinct identities in overlay networks[J]. Distributed Computing, 2007, 19(4): 267-287. url: http://dx.doi.org/10.1007/s00446-006-0012-y
[10]	ZHANG Ren, ZHANG Jianyu, CHEN Yu, et al.Making eclipse attacks computationally infeasible in large-scale DHTs [C]// Performance Computing and Communications Conference (IPCCC), 2011 IEEE 30th International. Washington DC, USA: IEEE Press, 2011: 1-8.
[11]	Rowaihy H, Enck W, McDaniel P, et al. Limiting sybil attacks in structured peer-to-peer networks [C]// IEEE Infocom Mini-Symposium. Washington DC, USA: IEEE Press, 2005.
[12]	Mittal P, Caesar M, Borisov N. X-Vine: Secure and pseudonymous routing using social networks [Z/OL]. (2013-10-13), http://arxiv.org/pdf/1109.0971.pdf.
[13]	Lesniewski-Lass C, Kaashoek M F. Whanau: Sybil-Proof Routing with Social Networks, Technical Report MIT-CSAIL-TR-2009-045 [R]. Cambridge, USA: Massachusetts Institute of Technology, 2009.
[14]	Lesniewski-Lass C, Kaashoek M F. Whanau: A sybil-proof distributed hash table [C]// 7th USENIX Symposium on Network Design and Implementation. Boston, USA: ACM SIGCOMM Computer Communication Review, 2010: 3-17.
[15]	Marti S, Ganesan P, Garcia-Molina H. SPROUT: P2P routing with social networks [C]// Current Trends in Database Technology-EDBT 2004 Workshops. Berlin, Germany: Springer, 2005: 425-435.
[16]	Hardt D. The OAuth 2.0 Authorization Framework [Z/OL]. (2013-10-13), http://tools.ietf.org/html/rfc6749.
[17]	Sina Corp. Sina Weibo Oauth API [Z/OL]. (2013-10-13), http://open.weibo.com/wiki/Oauth.
[18]	Renren Corp. Renren Oauth Wiki [Z/OL]. (2013-10-13), http://wiki.dev.renren.com/wiki/Authentication.
[19]	Tencent Corp. Tencent Weibo Oauth Wiki [Z/OL]. (2013-10-13), http://wiki.open.t.qq.com/index.php/OAuth授权说明.
[20]	Mitzenmacher M, Upfal E. Probability and computing: Randomized algorithms and probabilistic analysis [M]. Cambridge, UK: Cambridge University Press, 2005.
[21]	Viswanath B, Mislove A, Cha M, et al.On the evolution of user interaction in facebook [C]// Proceedings of the 2nd ACM Workshop on Online Social Networks. Danvers, USA: Association for Computing Machinery, 2009: 37-42.

[1]	ZHU Weiyi, ZHANG Xueqin, GU Chunhua. Social network information leakage node probability prediction based on the EDLATrust algorithm[J]. Journal of Tsinghua University(Science and Technology), 2022, 62(2): 355-366.
[2]	TU Shouzhong, YANG Jing, ZHAO Lin, ZHU Xiaoyan. Filtering Chinese microblog topics noise algorithm based on a semi-supervised model[J]. Journal of Tsinghua University(Science and Technology), 2019, 59(3): 178-185.
[3]	YAN Surong, FENG Xiaoqing, LIAO Yixing. Matrix factorization based social recommender model[J]. Journal of Tsinghua University(Science and Technology), 2016, 56(7): 793-800.
[4]	SUN Liyuan, GUAN Xiaohong. Measurements of the competitive characteristics of multi-topic propagation in online social networks[J]. Journal of Tsinghua University(Science and Technology), 2015, 55(11): 1157-1162.
[5]	Hanyu ZHU, Lianren WU, Tingjie LU. Research on quantifying user privacy on social networking sites[J]. Journal of Tsinghua University(Science and Technology), 2014, 54(3): 402-406.