Secure Data Collection with Updates

Authors:
Sergio Loureiro;Refik Molva;Alain Pannetrat
Affiliations:
Institut Eurécom, 2229 route des cretes, B.P. 193, 06904 Sophia-Antipolis cedex, France loureiro@eurecom.fr;Institut Eurécom, 2229 route des cretes, B.P. 193, 06904 Sophia-Antipolis cedex, France molva@eurecom.fr;Institut Eurécom, 2229 route des cretes, B.P. 193, 06904 Sophia-Antipolis cedex, France pannetra@eurecom.fr
Venue:
Electronic Commerce Research - Special issue on agents in electronic commerce
Year:
2001

Citing 6
Cited 2

Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A performance evaluation of the mobile agent paradigm

Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Ensuring the Integrity of Agent-Based Computations by Short Proofs

MA '98 Proceedings of the Second International Workshop on Mobile Agents
Protecting the Computation Results of Free-Roaming Agents

MA '98 Proceedings of the Second International Workshop on Mobile Agents
Update

MOS '96 Selected Presentations and Invited Papers Second International Workshop on Mobile Object Systems - Towards the Programmable Internet
Agent-mediated electronic commerce: a survey

The Knowledge Engineering Review

Using “fair forfeit” to prevent truncation attacks on mobile agents

ACISP'05 Proceedings of the 10th Australasian conference on Information Security and Privacy
The prediction of network efficiency in the smart grid

Electronic Commerce Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a protocol to protect data collected by mobile agents roaming through a set of potentially malicious hosts. This protocol is based on an original secure cryptographic technique that assures the integrity of a sequence of data segments regardless of the order of each segment in the sequence. The protocol allows each host to update the data it previously submitted in a way that is suitable for free competition scenarios like comparative shopping or distributed auction and for highly dynamic environments like stock markets. The set of hosts can be visited several times in random order and a short message digest allows for the integrity verification of all the collected data.