P2P Networks Considering Sybil-Proof with the Reputation of Social Link

Abstract:

In P2P networks, malice peers forge identity to interrupt routing, called Sybil attack. To avoid it, methods in related works consider routing as random walk. Since the destination of random walk is hard to predict, Sybil-proof P2P networks need large routing information to support routing. However, a large size routing table constrains the scalability of the system. Therefore, we aim to develop a routing algorithm to satisfy the requirement of P2P networks which has a good performance at Sybil-Proof by using a reasonable size of routing table. Social links are useful to prevent a Sybil attack because friend peers have little chance to be a Sybil peer. In this proposed method, reputation of social link is useful for achieving this objective. Considering the distance to destination peers can help for routing efficiency and considering the reputation can make routing to have better performance resisting Sybil-attacks.

• Periodical: Applied Mechanics and Materials (Volumes 446-447)
• Pages: 1596-1600
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.446-447.1596
• Online since: November 2013
• Authors: Zong Yuan Guo, Carlos Madrazo, Keiichi Koyanag
• Keywords: P2P, Reputation, Routing, Scalability, Social Link, Sybil Proof

References

[1] JohnR. Douceur. The Sybil attack. In Proceedings for the 1st International Work shop on Peer-to-Peer Systems (IPTPS02), Cambridge, Massachusetts, March (2002).

[2] H. Yu, M. Kaminsky, P.B. Gibbons, and A. Flaxman. Sybil Guard: Defend-Ing Against Sybil Attacks Via Social Networks. SIGCOMM, Pisa, Italy, Sept. (2006).

DOI: 10.1145/1151659.1159945

[3] H. Yu, P.B. Gibbons, M. Kaminsky, andF. Xiao. ANear-Optimal Social Network Defense Against Sybil Attacks. IEEE Symposiumon Security and Privacy, Oakland, CA, May2008.

DOI: 10.1109/sp.2008.13

[4] C. Lesniewski-Lass, M.F. Kaashoek. Whānau: A Sybil proof distributed hash table In 7 th USENIX Symposium On Network Design and Implementation , pages3–17, (2010).

[5] S. Marti, P. Ganesan, H. Garcia-Molina, DHT Routing Using Social Links Lecture Notes in Computer Science, 2005, Volume 3279/2005, 100-111.

DOI: 10.1007/978-3-540-30183-7_10

[6] I. Stoica, et al., Chord: A scalable peer-to-peer lookup service for internet applications, SIGCOMM Comput. Commun. Rev., vol. 31, pp.149-160, (2001).

DOI: 10.1145/964723.383071

[7] M. Castro, P. Druschel, A.J. Ganesh, A.I.T. Rowstron, and D.S. Wal-lach. Secure Routing for Structured Peer-to-Peer Overlay Networks. OSDI, Boston, MA, Dec. (2002).

DOI: 10.1145/1060289.1060317

[8] A. Singh, T. -W. Ngan, P. Druschel, andD.S. Wallach. Eclipse Attackson Overlay Networks: Threats and Defenses. INFOCOM, Barcelona, Spain, Apr. (2006).

DOI: 10.1109/infocom.2006.231

[9] F. Li and J. Wu, Mobility Reduces Uncertainty in Manets, " Proc. Int, l Conf. Computer Communications (INFOCOM 07), IEEE CS Press, 2007, p.1946–(1954).

DOI: 10.1109/infcom.2007.226

[10] Márk Jelasity, Alberto Montresor, Gian Paolo Jesi, Spyros Voulgaris. http: /peersim. sourceforge. net.