Analysis of a Free Roaming Agent Result-Truncation Defense Scheme

TitleAnalysis of a Free Roaming Agent Result-Truncation Defense Scheme
Publication TypeConference Paper
Year of Publication2004
AuthorsJ. Zhou, J. A. Onieva, and J. Lopez
Conference Name6th Conference on E-Commerce (CEC’04)
Pagination221-226
Date PublishedJune
PublisherIEEE Computer Society
Abstract

Mobile agents play an important role in electronic commerce. Security in free-roaming agents is especially hard to achieve when the mobile code is executed in hosts that may behave maliciously. Some schemes have been proposed to protect agent data (or computation results). However, a known vulnerability of these techniques is the truncation attack where two visited hosts (or one revisited host) can collude to discard the partial results collected between their respective visits. Cheng and Wei proposed a scheme in ICICS’02 to defense against the truncation of computation results of free-roaming agents. Cheng-Wei scheme is effective against such an attack in most cases. However, we demonstrate that it still suffers from the truncation attack when a special loop is established on the path of a free-roaming agent. We further propose two amendments to Cheng-Wei scheme to avoid such an attack.

Citation KeyJianyingZhou2004
Paper File: 
https://www.nics.uma.es/sites/default/files/papers/JianyingZhou2004.pdf