Documento de conferencia

A low-variance random-walk procedure to provide anonymity in overlay networks

Book Series cp
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • Volumen: 5283 LNCS
  • Fecha: 08 diciembre 2008
  • Páginas: 238-250
  • ISSN: 03029743 16113349
  • ISBN: 3540883126
  • Tipo de fuente: Serie de libros
  • DOI: 10.1007/978-3-540-88313-5-16
  • Tipo de documento: Documento de conferencia
An alternative to guarantee anonymity in overlay networks may be achieved by building a multi-hop path between the origin and the destination. However, one hop in the overlay network can consist of multiple Internet Protocol (IP) hops. Therefore, the length of the overlay multi-hop path must be reduced in order to maintain a good balance between the cost and the benefit provided by the anonymity facility. Unfortunately, the simple Time-To-Live (TTL) algorithm cannot be directly applied here since its use could reveal valuable information to break anonymity. In this paper, a new mechanism which reduces the length of the overlay multi-hop paths is presented. The anonymity level is evaluated by means of simulation and good results are reported © 2008 Springer Berlin Heidelberg.

Palabras clave del autor

    Palabras clave indexadas

      Detalles de financiación