Secure route structures for parallel mobile agents based systems using fast binary dispatch

Yan Wang*, Vijay Varadharajan

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

In a distributed environment, where a large number of computers are connected together to enable the large-scale sharing of data and computing resources, agents, especially mobile agents, are the tools for autonomously completing tasks on behalf of their owners. For applications of large-scale mobile agents, security and efficiency are of great concern. In this paper, we present a fast binary dispatch model and corresponding secure route structures for mobile agents dispatched in parallel to protect the dispatch routes of agents while ensuring the dispatch efficiency. The fast binary dispatch model is simple but efficient with a dispatch complexity of O(log2 n). The secure route structures adopt the combination of public-key encryption and digital signature schemes and expose minimal route information to hosts. The nested structure can help detect attacks as early as possible. We evaluated the various models both analytically and empirically.

Original languageEnglish
Pages (from-to)185-205
Number of pages21
JournalMobile Information Systems
Volume1
Issue number3
Publication statusPublished - 2005

Keywords

  • Mobile agent
  • Robust route structure
  • Secure route structure

Fingerprint Dive into the research topics of 'Secure route structures for parallel mobile agents based systems using fast binary dispatch'. Together they form a unique fingerprint.

Cite this