Defending Against Some Active Attacks in P2P Overlay Networks 


Vol. 31,  No. 4, pp. 451-457, Apr.  2006


PDF Full-Text
  Abstract

A peer-to-peer(P2P) network is inherently vulnerable to malicious attacks from participating peers because of its open, flat, and autonomous nature. This paper addresses the problem of effectively defending from active attacks of malicious peers at bootstrapping phase and at online phase, respectively. We propose a secure membership handling protocol to protect the assignment of ID related things to a newly joining peer with the aid of a trusted entity in the network. The trusted entities are only consulted when new peers are joining and are otherwise uninvolved in the actions of the P2P networks. For the attacks in online phase, we present a novel message structure applied to each message transmitted on the P2P overlay. It facilitates the detection of message alteration, replay attack, and a message with wrong information. Taken together, the proposed techniques deter malicious peers from cheating and encourage good peers to obey the protocol of the network. The techniques assume a basic P2P overlay network model, which is generic enough to encompass a large class of well-known P2P networks, either unstructured or not.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

J. Park, "Defending Against Some Active Attacks in P2P Overlay Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 4, pp. 451-457, 2006. DOI: .

[ACM Style]

Jun-Cheol Park. 2006. Defending Against Some Active Attacks in P2P Overlay Networks. The Journal of Korean Institute of Communications and Information Sciences, 31, 4, (2006), 451-457. DOI: .

[KICS Style]

Jun-Cheol Park, "Defending Against Some Active Attacks in P2P Overlay Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 31, no. 4, pp. 451-457, 4. 2006.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880