Documento de conferencia

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

Book Series cp
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • Volumen: 4786 LNCS
  • Fecha: 01 diciembre 2007
  • Páginas: 25-36
  • ISSN: 03029743 16113349
  • ISBN: 9783540758525
  • Tipo de fuente: Serie de libros
  • Tipo de documento: Documento de conferencia
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. © Springer-Verlag Berlin Heidelberg 2007.

Palabras clave del autor

    Palabras clave indexadas

      Detalles de financiación