Abstract
A mobile agent’s itinerary describes the set of hosts visited during the agent’s travel, and must be protected against malicious entities trying to access and/or modify it for their own benefit. Protection mechanisms must be put in place, but we should avoid imposing unnecessary limitations on the agent’s ability to choose its itinerary in an as flexible as possible way. In this article, we extend previous work on itinerary protection protocols to include loops among the allowable protected itineraries for roaming agents. Our agents can thus traverse a whole new range of paths in a secure way.
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
Ametller, J., Robles, S., Ortega-Ruiz, J.A.: Self-protected mobile agents. In: AAMAS 2004: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, Washington, DC, USA, pp. 362–367. IEEE Computer Society, Los Alamitos (2004)
Corradi, A., Montanari, R., Stefanelli, C.: Mobile agents protection in the internet environment. In: 23rd Annual International Computer Software and Applications Conference (1999)
Giansiracusa, M., Russell, S., Clark, A., Roth, V.: Macro-level attention to mobile agent security: Introducing the mobile agent secure hub infrastructure concept. In: López, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol. 3269, pp. 343–357. Springer, Heidelberg (2004)
Karnik, N.M., Tripathi, A.R.: Security in the Ajanta mobile agent system. Software Practice and Experience 31(4), 301–329 (2001)
R. Laboratories. PKCS 7: Cryptographic message syntax standard (1993)
Mir, J., Borrell, J.: Protecting general flexible itineraries of mobile agents. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol. 2288, p. 382. Springer, Heidelberg (2002)
Mir, J., Borrell, J.: Protecting mobile agent itineraries. In: Horlait, E., Magedanz, T., Glitho, R.H. (eds.) MATA 2003. LNCS, vol. 2881, pp. 275–285. Springer, Heidelberg (2003)
Roth, V.: Empowering mobile software agents. In: Suri, N. (ed.) MA 2002. LNCS, vol. 2535, pp. 47–63. Springer, Heidelberg (2002)
Roth, V.: On the robustness of some cryptographic protocols for mobile agent protection. In: Picco, G.P. (ed.) MA 2001. LNCS, vol. 2240, p. 1. Springer, Heidelberg (2001)
Roth, V.: Programming satan’s agents. Electr. Notes Theor. Comput. Sci. 63 (2001)
Straßer, M., Rothermel, K., Maiöfer, C.: Providing Reliable Agents for Electronic Commerce. In: Lamersdorf, W., Merz, M. (eds.) TREC 1998. LNCS, vol. 1402, pp. 241–253. Springer, Heidelberg (1998)
Tsipenyuk, Y., Yee, B.: Detecting external agent replay and state modification attacks (February 2005), http://www-cse.ucsd.edu/~ytsipeny/home/research/paper.pdf
Westhoff, D., Schneider, M., Unger, C., Kaderali, F.: Protecting a Mobile Agent’s Route against Collusions. In: Heys, H.M., Adams, C.M. (eds.) SAC 1999. LNCS, vol. 1758, p. 215. Springer, Heidelberg (2000)
White, J.E.: Telescript technology: Mobile agents. In: Bradshaw, J. (ed.) Software Agents, AAAI Press/MIT Press, Menlo Park (1996)
Yee, B.S.: A sanctuary for mobile agents. Secure Internet Programming, 261–273 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cucurull, J., Ametller, J., Ortega-Ruiz, J.A., Robles, S., Borrell, J. (2005). Protecting Mobile Agent Loops. In: Magedanz, T., Karmouch, A., Pierre, S., Venieris, I. (eds) Mobility Aware Technologies and Applications. MATA 2005. Lecture Notes in Computer Science, vol 3744. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11569510_8
Download citation
DOI: https://doi.org/10.1007/11569510_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29410-8
Online ISBN: 978-3-540-32031-9
eBook Packages: Computer ScienceComputer Science (R0)