TY - GEN
T1 - Ensuring the integrity of agent - Based computations by short proofs
AU - Biehl, Ingrid
AU - Meyer, Bernd
AU - Wetzel, Susanne
PY - 1998
Y1 - 1998
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84867304375&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84867304375&partnerID=8YFLogxK
U2 - 10.1007/bfb0057658
DO - 10.1007/bfb0057658
M3 - Conference contribution
AN - SCOPUS:84867304375
SN - 354064959X
SN - 9783540649595
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 183
EP - 194
BT - Mobile Agents - Second International Workshop, MA'98, Proceedings
T2 - 2nd International Workshop on Mobile Agents, MA'98
Y2 - 9 September 1998 through 11 September 1998
ER -