2003
DOI: 10.1007/978-3-540-39646-8_26
|View full text |Cite
|
Sign up to set email alerts
|

Protecting Mobile Agent Itineraries

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Year Published

2004
2004
2010
2010

Publication Types

Select...
4
4

Relationship

3
5

Authors

Journals

citations
Cited by 13 publications
(13 citation statements)
references
References 13 publications
0
13
0
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%
See 2 more Smart Citations
“…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%
“…Regarding the protection of the agent's itinerary, techniques such as Karnik and Tripathi (2001) or Roth (2002) enable the protection sequential itineraries. On the other hand, Mir and Borrell (2003) and Garrigues et al (2008b) also support the protection of flexible itineraries.…”
Section: Mobile Agent Securitymentioning
confidence: 99%
See 1 more Smart Citation
“…The protection of static itineraries is based on the protocol presented in Mir and Borrell (2003). The main dierence between this and our approach is that we provide our mobile agents with a control code that manages their own protection mechanisms.…”
Section: Protection Of Static Itinerariesmentioning
confidence: 99%
“…The problem of current solutions (Yee, 2003;Westhoff et al, 1999;Wilhelm et al, 1998;Li et al, 2000;Suen, 2003;Mir and Borrell, 2003;Che et al, 2006;Cucurull et al, 2005) against external replay attacks is that they do not allow an agent to be executed n times on the same platform, especially if n is determined at runtime. However, the agent's itinerary often contains roundtrips that require the same platform to be visited several times.…”
Section: Introductionmentioning
confidence: 99%