Abstract
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.
Cite
CITATION STYLE
Muñoz-Gea, J. P., Malgosa-Sanahuja, J., Manzanares-Lopez, P., Sanchez-Aarnoutse, J. C., & Garcia-Haro, J. (2008). A low-variance random-walk procedure to provide anonymity in overlay networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5283 LNCS, pp. 238–250). Springer Verlag. https://doi.org/10.1007/978-3-540-88313-5_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
