An efficient and reliable anonymous solution for a self-organized P2P network

Authors:
J. P. Muñoz-Gea;J. Malgosa-Sanahuja;P. Manzanares-Lopez;J. C. Sanchez-Aarnoutse;J. Garcia-Haro
Affiliations:
Department of Information Technologies and Communications, Polytechnic University of Cartagena, Cartagena, Spain;Department of Information Technologies and Communications, Polytechnic University of Cartagena, Cartagena, Spain;Department of Information Technologies and Communications, Polytechnic University of Cartagena, Cartagena, Spain;Department of Information Technologies and Communications, Polytechnic University of Cartagena, Cartagena, Spain;Department of Information Technologies and Communications, Polytechnic University of Cartagena, Cartagena, Spain
Venue:
IPOM'07 Proceedings of the 7th IEEE international conference on IP operations and management
Year:
2007

Citing 7
Cited 0

Anonymous Web transactions with Crowds

Communications of the ACM
Payload analysis of anonymous communication system with host-based rerouting mechanism

ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Anonymous routing in structured peer-to-peer overlays

Anonymous routing in structured peer-to-peer overlays
Bandwidth-efficient management of DHT routing tables

NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Towards measuring anonymity

PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
A self-organized P2P network for an efficient and secure content location and download

DBISP2P'05/06 Proceedings of the 2005/2006 international conference on Databases, information systems, and peer-to-peer computing
Anonymous connections and onion routing

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new mechanism to achieve anonymity in peer-to-peer (P2P) file sharing systems is proposed. As usual, anonymity is obtained by means of connecting the source and destination peers through a set of intermediate nodes, creating a multiple-hop path. The main contribution of the paper is a distributed algorithm able to guarantee the anonymity even when a node in a path fails (voluntarily or not). The algorithm takes into account the inherent costs associated with multiple-hop communications and tries to reach a well-balanced solution between the anonymity degree and its associated costs. Some parameters are obtained analytically but the main network performances are evaluated by simulation. We quantify the costs associated with the control packets used by the distributed recovery algorithm. On the other hand, we also measure the anonymity provided by our system (benefit), using a simulation-based analysis to calculate the average entropy.