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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Reed, M.G., Syverson, P.F., Goldshlag, D.M.: Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications 16(4), 482–494 (1998)
Reiter, M.K., Rubin, A.D.: Crowds: Anonymity for web transactions. Communications of the ACM 42(2), 32–48 (1999)
Wright, M., Adler, M., Levine, B.N., Shields, C.: An analysis of the degradation of anonymous protocols. In: NDSS 2002. Proceedings of the Network and Distributed Security Symposium, San Diego, CA, USA (2002)
Sui, H., Chen, J., Chen, S., Wang, J.: Payload analysis of anonymous communication system with host-based rerouting mechanism. In: ISCC 2003. Proceedings of the Eighth IEEE International Symposium on Computers and Communications, Kemer-Antalya, Tuerkey, IEEE Computer Society Press, Los Alamitos (2003)
Muñoz-Gea, J.P., Malgosa-Sanahuja, J., Manzanares-Lopez, P., Sanchez-Aarnoutse, J.C., Garcia-Haro, J.: A self-organized p2p network for an efficient and secure content location & download. In: Moro, G., Bergamaschi, S., Joseph, S., Morin, J.-H., Ouksel, A.M. (eds.) DBISP2P 2006/2005. LNCS, vol. 4125, pp. 368–375. Springer, Heidelberg (2007)
Pfitzmann, A., Kohntopp, M., Showtack, A.: Anonymity, unlinkability, unobservability, pseudonymity and identity management - A consolidated proposal for terminology. Manuscript (May 2006)
Li, J., Stribling, J., Morris, R., and Kaashoek, M. F.: Bandwidth-efficient management of dht routing tables. In: NSDI 2005. Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation, Boston, MA, USA (2005)
Díaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol. 2482, Springer, Heidelberg (2003)
Borisov, N: Anonymous routing in structured peer-to-peer overlays, Ph.D. Thesis, UC Berkeley (May 2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Muñoz-Gea, J.P., Malgosa-Sanahuja, J., Manzanares-Lopez, P., Sanchez-Aarnoutse, J.C., Garcia-Haro, J. (2007). An Efficient and Reliable Anonymous Solution for a Self-organized P2P Network. In: Medhi, D., Nogueira, J.M., Pfeifer, T., Wu, S.F. (eds) IP Operations and Management. IPOM 2007. Lecture Notes in Computer Science, vol 4786. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75853-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-75853-2_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75852-5
Online ISBN: 978-3-540-75853-2
eBook Packages: Computer ScienceComputer Science (R0)