Browse > Article

Defending Against Some Active Attacks in P2P Overlay Networks  

Park Jun-Cheol (홍익대학교 컴퓨터공학과 컴퓨터네트워킹연구실)
Publication Information
The Journal of Korean Institute of Communications and Information Sciences / v.31, no.4C, 2006 , pp. 451-457 More about this Journal
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.
Keywords
P2P Overlay Network; Malicious Peer; Defense; Cryptographic Means; Bootstrapping;
Citations & Related Records
연도 인용수 순위
  • Reference
1 E. Sit, R. Morris, 'Security Considerations for Peer-to-Peer Distributed Hash Tables', Proc. Int'l Workshop on Peer-to-Peer Systems, March 2002
2 J. Douceur, 'The Sybil Attack', Proc. lnt'l Workshop on Peer-to-Peer Systems, March 2002
3 S. Marti, H. Garcia-Molina, 'Taxonomy of Trust: Categorizing P2P Reputation Systems', COMNET Special Issue on Trust and Reputation in Peer-to-Peer Systems, 2005
4 P. Dewan, P. Dasgupta, 'Securing P2P Networks Using Peer Reputations: Is there a silver bullet?', Proc. IEEE Consumer Communications and Networking Conf.(CCNC2005), USA, 2005
5 A. Blanc, Y. Liu, A. Vahdat, 'Designing Incentives for Peer-to-Peer Routing', Proc. IEEE INFOCOM, March 2005
6 M. Rabin, 'Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance', Journal of the ACM, 36(2), April 1989
7 A. Shamir, 'How to Share a Secret', Communications of the ACM, 22, 1979
8 J. Risson, T. Moors, 'Survey of Research Towards Robust Peer-to-Peer Networks: Search Methods', TR UNSW-EE-P2P-l-l, Univ. of New South Wales, Australia, September 2004
9 J. Liang, R. Kumar, Y. Xi, K. Ross, 'Pollution in P2P File Sharing Systems', Proc. IEEE INFOCOM, March 2005
10 S. Androutsellis-Theotokis, D. Spinellis, 'A Survey of Peer-to-Peer Content Distribution Technologies', ACM Computing Surveys, 36(4), December 2004
11 P. Dewan, 'Countering Identity Farms in Reputation Systems for P2P Networks', Arizona State University, Technical Report, 2004
12 D. Wallach, 'A Survey of Peer-to-Peer Security Issues', Proc. Int'l Symp. on Software Security, November 2002
13 M. Parameswaran, A. Susarla, A.B. Whinston, 'P2P Networking: An Information-Sharing Alternative', IEEE Computer, 34(7), July 2001
14 M. Castro, P. Druschel, A. Ganesh, A. Rowstron, D. Wallach, 'Secure Routing for Structured Peer-to-Peer Overlay Networks', Proc. Usenix Symp. on Operating Systems, December 2002