Abstract
In this paper, a disconnection-aware mechanism to provide anonymity in two-level P2P 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 also quantify the costs associated with the control packets used by the distributed recovery algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
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)
Freedman, M., Morris, R.: Tarzan: A peer-to-peer anonymizing network layer. In: CCS 2002. Proceedings of the 9th ACM Conference on Computer and Communications Security, Washington, DC, USA (2002)
Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium, San Diego, CA, USA (2004)
Han, J., Liu, Y., Xiao, L., Xiao, R., Ni, L.M.: A mutual anonymous peer-to-peer protocol design. In: Proceedings of the 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), Denver, CO, USA (2005)
Xiao, L., Xu, Z., Shang, X.: Low-cost and reliable mutual anonymity protocols in peer-to-peer networks. IEEE Transactions on Parallel and Distributed Systems 14(9), 829–840 (2003)
Levine, B.N., Shields, C.: Hordes: A multicast-based protocol for anonymity. Journal of Computer Security 10(3), 213–240 (2002)
Mislove, A., Oberoi, G.A., Post, C.R., Druschel, P.: Ap3: Cooperative, decentralized anonymous communication. In: Proceedings of the 11th workshop on ACM SIGOPS European workshop: beyond the PC, New York, NY, USA (2004)
Lu, T., Fang, B., Sun, Y., Cheng, X.: Wongoo: A peer-to-peer protocol for anonymous communication. In: Proceedings of the 2004 International Conference on Parallel and Distributed Processing Techniques and Appliations (PDPTA 2004), Las Vegas, NE, USA (2004)
Wright, M., Adler, M., Levine, B.N., Shields, C.: An analysis of the degradation of anonymous protocols. In: Proceedings of the Network and Distributed Security Symposium (NDSS 2002), San Diego, CA, USA (2002)
Sui, H., Chen, J., Che, S., Wang, J.: Payload analysis of anonymous communication system with host-based rerouting mechanism. In: Proceedings of the Eighth IEEE International Symposium on Computers and Communications (ISCC 2003), Kemer-Antalya, Turkey (2003)
Muñoz-Gea, J.P., Malgosa-Sanahuja, J., Manzanares-Lopez, P., Sanchez-Aarnoutse, J.C., Guirado-Puerta, A.M.: A hybrid topology architecture for p2p file sharing systems. In: Shishkov, F.B., Helfert, M. (eds.) ICSOFT 2006. CCIS 10, pp. 220–229. Springer, Heidelberg (2008)
Ratnasamy, S., Handley, M., Karp, R., Shenker, S.: Application-level multicast using content-addressable networks. In: Proceedings of the 3rd International Workshop of Networked Group Communication, London, UK (2001)
Ghodsi, A., Alima, L., El-Ansary, S., Brand, P., Haridi, S.: Dks(n,k,f): A family of low communication, scalable and fault-tolerant infrastructures for p2p applications. In: Proceedings of the 3rd International Workshop on Global and P2P Computing on Large Scale Distributed Systems CCGRID 2003, Tokyo, Japan (2003)
Castro, M., Druschel, P., Kermarrec, A., Rowstron, A.: Scribe: A large-scale and decentralized application-level multicast infrastructure. IEEE Journal On Selected Areas in Communications 20(8), 100–110 (2002)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proceedings of ACM SIGCOMM, San Diego, CA, USA (2001)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.: Chord: A scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003)
Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)
Pfitzmann, A., Hansen, M.: Anonymity, unobservability and pseudomyity: a proposal for terminology. In: Proceedings of the Fourth International Information Hiding Workshop, Pittsburgh, PE, USA (2001)
Postel, J.: RFC 791: Internet Protocol (1981)
Li, J., Stribling, J., Morris, R., Kaashoek, M.F.: Bandwidth-efficient management of dht routing tables. In: Proceedings of the 2nd USENIX Symposium on Networked Systems Design and Implementation (NSDI 2005), Boston, MA, USA (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 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. (2008). A Disconnection-Aware Mechanism to Provide Anonymity in Two-Level P2P Systems. In: Filipe, J., Shishkov, B., Helfert, M., Maciaszek, L.A. (eds) Software and Data Technologies. ICSOFT ENASE 2007 2007. Communications in Computer and Information Science, vol 22. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88655-6_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-88655-6_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88654-9
Online ISBN: 978-3-540-88655-6
eBook Packages: Computer ScienceComputer Science (R0)