Efficient caching strategies for gnutella-like systems to achieve anonymity in unstructured p2p file sharing

  • Authors:
  • Byung Ryong Kim;Ki Chang Kim

  • Affiliations:
  • School of Computer and Science Engineering, Inha Univ., Incheon, Korea;School of Information and Communication Engineering, Inha Univ., Incheon, Korea

  • Venue:
  • NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A critical problem in a Peer-to-Peer file sharing system is how to protect the anonymity of agent nodes when providing efficient data access services. Most of existing technique mostly focus on how to provide the initiator anonymity and privacy, but leave the anonymity of the server. Our technique is similar to Onion routing in that it uses a proxy node to hide the identity of the client and the server. But it differs from it in that the proxy node is selected dynamically for each session and not fixed as in Onion routing. The fixed proxy might be convenient to use and is useful when loaded with additional features such as encryption as in Onion routing. However it is a sort of compromise from P2P point of view: we are introducing something similar to a control center that could become a bottleneck in the network. Temporary proxy doesn't have this problem. And our technique provides caching of a retrieved data item on the reverse path back to the requestor. Caching in our paper is primarily for providing publisher anonymity and security. In this paper, we show a technique to find such proxy and caching, explain the rationale behind the decision, and prove its effectiveness through experimentation.