Abstract
P2P networks provide a basic form of anonymity, and the participating nodes exchange information without knowing who is the original sender. Packets are relayed through the adjacent nodes and do not contain identity information about the sender. Since these packets are passed through a dynamically-formed path and since the final destination is not known until the last time, it is impossible to know who has sent it in the beginning and who will be the final recipient. The anonymity, however, breaks down at download/upload time because the IP address of the host from which the data is downloaded (or to which it is uploaded) can be known to the outside. We propose a technique to provide anonymity for both the client and the server node. A relay node along the path between the client and the server node is selected as an agent node and works as a proxy: the client will see it as the server and the server looks at it as the client, hence protecting the identity of the client and the server from anonymity-breaking attacks.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, p. 46. Springer, Heidelberg (2001)
Hildrum, K., Kubiatowicz, J., Rao, S., Zhao, B.Y.: Distributed Object Location in a Dynamic Network. Theory of Computing Systems (2004)
Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: A Resilient Global-scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications (2004)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable content-addressable network. In: Proceedings of the 2001 conference on Applications, tech-nologies, architectures, and protocols for computer communications table of contents (2001)
Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (2003)
MUTE: Simple, Anonymous File Sharing, http://mute-net.sourceforge.net/
Dingledine, R., Mathewson, N., Syverson, P.: Tor: The Second-Generation Onion Router. In: Proceedings of the 13th USENIX Security Symposium (2004)
Goldschlag, D., Reed, M., Syverson, P.: Onion routing for anonymous and private Internet connections. Communications of the ACM 42(2), 39–41 (1999)
Reiter, M.K., Rubin, A.D.: Anonymous web transactions with Crowds. Communications of the ACM 42(2), 32–38 (1999)
Bono, S.C., Soghoian, C.A., Monrose, F.: Mantis: A Lightweight, Server-Anonymity Preserving, Searchable P2P, Information Security Institute of The Johns Hop-kins University, Technical Report TR-2004-01-B-ISI-JHU (2004)
The Gnutella Protocol Specification v0.41 Document Revision 1.2, http://rfc-gnutella.sourceforge.net/developer/stable/index.html/
Gnutella Developer Forum, http://groups.yahoo.com/group/the_gdf/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, B. (2006). Protecting Agent from Attack in Grid Computing. In: Luo, Y. (eds) Cooperative Design, Visualization, and Engineering. CDVE 2006. Lecture Notes in Computer Science, vol 4101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11863649_15
Download citation
DOI: https://doi.org/10.1007/11863649_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44494-7
Online ISBN: 978-3-540-44496-1
eBook Packages: Computer ScienceComputer Science (R0)