Protecting Mobile Agents Against Malicious Hosts

Sander, Tomas; Tschudin, Christian

doi:10.1007/3-540-68671-1_4

Cited by 416 publications

(216 citation statements)

References 7 publications

Supporting

Mentioning

211

Contrasting

Unclassified

Order By: Relevance

“…Among the severe security threats faced in systems supporting mobile agents, a particularly troublesome one is a harmful host; that is, the presence at a network site of harmful stationary processes. The problem posed by the presence of a harmful host has been intensively studied from a programming point of view (e.g., see [12,16,18]), and recently also from an algorithmic prospective [8,9]. Obviously, the first step in any solution to such a problem must be to identify, if possible, the harmful host; i.e., to determine and report its location.…”

Section: Introductionmentioning

confidence: 99%

Multiple Agents RendezVous in a Ring in Spite of a Black Hole

Dobrev

Flocchini

Prencipe

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

The Rendezvous of anonymous mobile agents in a anonymous network is an intensively studied problem; it calls for k anonymous, mobile agents to gather in the same site. We study this problem when in the network there is a black hole: a stationary process located at a node that destroys any incoming agent without leaving any trace. The presence of the black hole makes it clearly impossible for all agents to rendezvous. So, the research concern is to determine how many agents can gather and under what conditions.In this paper we consider k anonymous, asynchronous mobile agents in an anonymous ring of size n with a black hole; the agents are aware of the existence, but not of the location of such a danger. We study the rendezvous problem in this setting and establish a complete characterization of the conditions under which the problem can be solved. In particular, we determine the maximum number of agents that can be guaranteed to gather in the same location depending on whether k or n is unknown (at least one must be known for any nontrivial rendezvous). These results are tight: in each case, rendezvous with one more agent is impossible.All our possibility proofs are constructive: we provide mobile agents protocols that allow the agents to rendezvous or near-gather under the specified conditions. The analysis of the time costs of these protocols show that they are optimal.Our rendezvous protocol for the case when k is unknown is also a solution for the black hole location problem. Interestingly, its bounded time complexity is Θ(n); this is a significant improvement over the O(n log n) bounded time complexity of the existing protocols for the same case.

show abstract

Section: Introductionmentioning

confidence: 99%

Multiple Agents RendezVous in a Ring in Spite of a Black Hole

Dobrev

Flocchini

Prencipe

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Pure software methods for confidentiality have CEF [19], black box security [20], environment-key [21], etc.…”

Section: F Computation Securitymentioning

confidence: 99%

Job Security in the Cloud Computing

Tuo¹,

Xu²,

Xu³

et al. 2015

IJFCC

View full text Add to dashboard Cite

Abstract-Cloud computing is a burgeoning Internet computing paradigm. The convenient, cheap and elastic resources in the cloud are attracting the users to migrate their assets (data, computing and software, etc.) into it. However, cloud also caused the serious worry about the security of those assets, since the resources are not under the control of the users. Traditional security mechanisms are usually aimed at single autonomous domain and are not suitable for protection of those assets migrating between autonomous domains. This paper caters to the security of aforesaid migrated assets, defines them as job, studies their security demands, analyses the security threats to them, and proposes the essential protecting mechanisms for it. Our work is from the point of view of the users, and thus will be more suitable for solving the security problem of their assets. 

show abstract

“…The use of encrypted programs [4] is proposed as the only way to give privacy and integrity to mobile code. Hosts execute the encrypted code directly.…”

Section: Attack Avoidance Approachesmentioning

confidence: 99%

Host Revocation Authority: A Way of Protecting Mobile Agents from Malicious Hosts

Esparza

Soriano

Muñoz

et al. 2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Mobile agents are software entities that consist of code, data and state, and that can migrate autonomously from host to host executing their code. Despite its benefits, security issues restrict the use of code mobility. The approach that is presented here aids to solve the problem of malicious hosts by using a Trusted Third Party, the Host Revocation Authority. The HoRA controls which are the hosts that acted maliciously in the past. The agent sender must consult the HoRA before sending an agent in order to remove from the agent's itinerary all the revoked hosts. The HoRA can also revoke a malicious host if the agent sender detects and proves that this malicious host did not act honestly.

show abstract

Protecting Mobile Agents Against Malicious Hosts

Cited by 416 publications

References 7 publications

Multiple Agents RendezVous in a Ring in Spite of a Black Hole

Multiple Agents RendezVous in a Ring in Spite of a Black Hole

Job Security in the Cloud Computing

Host Revocation Authority: A Way of Protecting Mobile Agents from Malicious Hosts

Contact Info

Product

Resources

About