A Model of Attacks of Malicious Hosts Against Mobile Agents

Hohl, Fritz

doi:10.1007/3-540-49255-0_77

Cited by 43 publications

(18 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The proposed solutions include the use of cooperative agents (Roth, 1998;Ouardani et al, 2007), cryptographic tracing (Vigna, 1997), obfuscated code (Hohl, 1998), secure coprocessors (Yee, 1994), protection of the computational results (Maggi and Sisto, 2003), or cryptographic protection of itineraries (Mir and Borrell, 2003).…”

Section: Mobile Agent Securitymentioning

confidence: 99%

Promoting the development of secure mobile agent applications

Garrigues¹,

Robles²,

Borrell³

et al. 2010

Journal of Systems and Software

View full text Add to dashboard Cite

In this paper we present a software architecture and a development environment for the implementation of applications based on secure mobile agents. Recent breakthroughs in mobile agent security have unblocked this technology, but there is still one important issue to overcome: the complexity of programming applications using these security solutions. Our proposal aims to facilitate and speed up the process of implementing cryptographic protocols, and to allow the reuse of these protocols for the development of secure mobile agents. As a result, the proposed architecture and development environment promote the use of mobile agent technology for the implementation of secure distributed applications.

show abstract

Section: Mobile Agent Securitymentioning

confidence: 99%

Promoting the development of secure mobile agent applications

Garrigues¹,

Robles²,

Borrell³

et al. 2010

Journal of Systems and Software

View full text Add to dashboard Cite

show abstract

“…In fact, protecting an agent from "host attacks" (i.e., harmful items stored at the visited site) has become a pressing security concern (e.g., see [5,11,13,15,17,18,20]). Still, this problem has not been taken into account so far by any of the existing solutions.…”

Section: Mobile Agents and Black Holementioning

confidence: 99%

Mobile Search for a Black Hole in an Anonymous Ring

Dobrev

Flocchini

Prencipe

et al. 2001

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In this paper we address the problem of mobile agents searching for a highly harmful item (called black hole) in a ring network. The black hole is a stationary process that destroys visiting agents upon their arrival without leaving any observable trace of such a destruction. The task is to have at least one surviving agent able to unambiguously report the location of the black hole.We consider different scenarios and in each situation we answer some computational as well as complexity questions. We first consider agents that start from the same homebase (co-located). We prove that two such agents are necessary and sufficient to locate the black hole; in our algorithm the agents perform O(nlogn) moves (where n is the size of the ring) and we show that such a bound is optimal. We also consider time complexity and we show how to achieve the optimal bound of 2n − 4 units of time using n − 1 agents. We generalize our technique to establish a trade-off between time and number of agents. We then consider the case of agents that start from different homebases (dispersed) and we show that, if the ring is oriented, two dispersed agents * A preliminary version of this paper appeared in the Proceedings of the 15th International Symposium on Distributed Computing [8].† University of Ottawa, email:sdobrev@site.uottawa.ca ‡ University of Ottawa, email:flocchin@site.uottawa.ca § contact author: Università di Pisa, Dipartimento di Informatica, Via Buonarroti, 2 -56100, Pisa, tel.+39 050 2213148, fax. +39 050 2212726, email:prencipe@di.unipi.it ¶ Carleton University, email: santoro@scs.carleton.ca 1 are still necessary and sufficient. Also in this case our algorithm is optimal in terms of number of moves (Θ(nlogn)). We finally show that, if the ring is unoriented, three agents are necessary and sufficient; an optimal algorithm follows from the oriented case.

show abstract

“…Nevertheless, security is one of the blocking factors of the development of these systems. The main unsolved security problem lies on the possible existence of malicious hosts that can manipulate the execution and data of agents [5].…”

Section: Introductionmentioning

confidence: 99%

Securing Mobile Agents for Electronic Commerce: An Experiment

Chan

Wong

et al. 2000

Information Security for Global Information Infrastructures

View full text Add to dashboard Cite

Abstract:Mobile software agents are becoming a major trend of distributed systems in the next decade. Electronic commerce and information retrieval are two prospective applications of mobile agents. Nevertheless, security is a crucial concern for such systems. Attacks to agents by malicious hosts are the most challenging part of the problem unsolved. In this paper, a Shopping Information Agent System (SIAS) is built based on mobile agent technology. Possible security attacks by malicious hosts to agents in the system are discussed, and solutions to prevent these attacks are presented. Security of the solutions is analysed, and the performance overhead introduced is evaluated.

show abstract

A Model of Attacks of Malicious Hosts Against Mobile Agents

Cited by 43 publications

References 0 publications

Promoting the development of secure mobile agent applications

Promoting the development of secure mobile agent applications

Mobile Search for a Black Hole in an Anonymous Ring

Securing Mobile Agents for Electronic Commerce: An Experiment

Contact Info

Product

Resources

About