Possible attacks on and countermeasures for secure multi-agent computation

Abstract

In this paper we improve the model for secure multi-agent computation proposed by Endsuleit and Mie. We apply a recent protocol from Hirt and Maurer for secure multi-party computation to build Alliances of n agents that solve a common task. The protocol used is very efficient with a communication load of O(n^2 m) (where m is the number of multiplications). All computations within the Alliance are robust as less than n/3 agents are corrupted at the same time