Researches on secure proximity distance defending attack of finger table based on chord

  • Authors:
  • Jie Li;Xiaofeng Qiu;Yang Ji;Chunhong Zhang

  • Affiliations:
  • Department of Infonnation and Communication Engineering, Beijing Univ. of Posts and Telecommunications China;Department of Infonnation and Communication Engineering, Beijing Univ. of Posts and Telecommunications China;Department of Infonnation and Communication Engineering, Beijing Univ. of Posts and Telecommunications China;Department of Infonnation and Communication Engineering, Beijing Univ. of Posts and Telecommunications China

  • Venue:
  • ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Structured Peer-to-peer networks overlay provide a substrate for the contribution of scalability, load balance, decentralization, and availability. However, new nodes are confronted with hijacking attacks on the Peer-to-Peer overlay with attackers. This paper proposes a model that the malicious nodes can not modify messages over the links and therefore can not control identifiers of correct nodes. However, malicious nodes could send fault messages to befool the correct nodes. Peer-to-Peer routing and location algorithm Chord is analyzed. Secure proximity distance that is security policy to defense the finger table attack is proposed. Analysis shows that the impact of attack is relative to the scale of overlay, the proportion of malicious nodes belonging to each attacker, the secure proximity distance, and the number of attackers. We conclude that the proportion of malicious nodes in the finger table will be higher than the proportion of malicious nodes in the overlay because of finger table attack.