Ensuring the integrity of agent - based computations by short proofs

Ingrid Biehl, Bernd Meyer, Susanne Wetzel

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

24 Citations (Scopus)

Abstract

Mobile code technology is gaining growing importance for example for electronic commerce applications. To come to a widespread use of mobile agents a lot of security aspects have to be seriously considered and security problems have to be solved to convince potential users of this technology. So far, most work concerning security in the area of mobile code was done to protect hosts from malicious agents. However, in the very recent literature approaches are discussed which lead to different levels of security for the mobile agent against attacks by dishonest hosts. A central problem consists in the integrity of computation: In order to profit from mobile agent technology, techniques have to be used which guarantee the correctness of the results returned by a mobile agent to its originator. In this paper we explain a general approach to cope with the integrity problem by supplementing computation results with very short proofs of correctness which can a posteriori be checked by the originator of the mobile code to verify whether the result is reliable or not.

Original languageEnglish
Title of host publicationMobile Agents - Second International Workshop, MA'98, Proceedings
PublisherSpringer
Pages183-194
Number of pages12
ISBN (Print)354064959X, 9783540649595
Publication statusPublished - 1998
Externally publishedYes
Event2nd International Workshop on Mobile Agents, MA'98 - Stuttgart, Germany
Duration: 9 Sep 199811 Sep 1998

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume1477
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd International Workshop on Mobile Agents, MA'98
Country/TerritoryGermany
CityStuttgart
Period9/09/9811/09/98

Cite this