RDS: Remote Distributed Scheme for Protecting Mobile Agents

Asnat Dadon-Elichai

Paper 2004/023

RDS: Remote Distributed Scheme for Protecting Mobile Agents

Asnat Dadon-Elichai

Abstract

As of today no solely software-based solution that a priori protects the computation of any mobile code and/or mobile agent was presented. Furthermore, Algesheimer et al. [1], argue that minimal trust in a third party is essential for the protection of mobile entities. This paper shows that under very mild assumptions, there exists a software-only based solution that can protect any computation of mobile entities in polynomial time bound systems, and without relaying on the minimal trust requirement. A novel Remote Distributed Scheme, called RDS, is described. RDS is based on fault-tolerant and modest cryptographic techniques and supports an a priori protection of any mobile computation that is carried in an honest-but-curious environment (“trusted entities”). We next show, by using on probabilistic techniques, that RDS provides an a priori protection for any mobile computation, in any environment, and for any required level of secrecy. We also prove that RDS equivalents, and by thus, provides the same level of protection that is supports by the traditional client/server scheme.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: Security mobile agents mobile codes secret-sharing fault-tolerant.
Contact author(s): elichai1 @ bezekint net
History: 2004-02-02: received
Short URL: https://ia.cr/2004/023
License: CC BY

BibTeX

@misc{cryptoeprint:2004/023,
      author = {Asnat Dadon-Elichai},
      title = {{RDS}: Remote Distributed Scheme for Protecting Mobile Agents},
      howpublished = {Cryptology {ePrint} Archive, Paper 2004/023},
      year = {2004},
      url = {https://eprint.iacr.org/2004/023}
}