Securing overlay activities of peers in unstructured P2P networks
- Authors
- Park, J.-C.; Yu, G.
- Issue Date
- 2006
- Publisher
- IEEE Computer Society
- Citation
- 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006, v.2, pp.1105 - 1108
- Journal Title
- 2006 International Conference on Computational Intelligence and Security, ICCIAS 2006
- Volume
- 2
- Start Page
- 1105
- End Page
- 1108
- URI
- https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/25039
- DOI
- 10.1109/ICCIAS.2006.295433
- ISSN
- 0000-0000
- Abstract
- This paper discusses how to secure overlay activities of peers on overlay level messages exchanged in unstructured P2P networks. We identify some attacks that can be effectively handled by appropriate cryptographic means. We then give a detection method against those attacks including message modification, replay attack, and message generation with wrong information. The method presumes the existence of a set of CAs, which are consulted when peers are newly joining the network and otherwise uninvolved in the peer activities. We also address the attack of a peer's illegal dropping of relaying messages, which is hard to be traced to its doer even with the assist of cryptographic means. We propose an audit and topology adaptation technique to confine and weaken the ill effect of such an attack on other peers in the network. We demonstrate the effectiveness of the technique using a modified GnutellaSim [6] simulator with respect to various metrics. Being based upon a generic overlay model, the proposed techniques can be applied to any unstructured P2P network either separately or all together. © 2006 IEEE.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/25039)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.