Secure Multi-Agent Computations

We propose a security model for open multi-agent systems. Given a user-defined task T , we generate a group of mobile agents which realise a common functionality that solvesT . Those agents cooperate with each other and build an autonomous community. Using a scheme for secure distributed computations, this community is able to perform secure computations without requiring interaction with a trusted party. To get some formal security guarantees we incorporate Canetti’s model for secure multi-party computations (see [6]) into the agent setting. Canetti’s model as sumes stationary parties and so does not cover the agents’ migration process. But we will present a solution to this. Thus, we yield guarantees for code, data and execution integrity, data privacy and prevention from malicious routin g.

[1]  Volker Roth,et al.  Mutual Protection of Co-operating Agents , 2001, Secure Internet Programming.

[2]  Sergio Loureiro,et al.  Function hiding based on error correcting codes , 1999 .

[3]  Christian F. Tschudin,et al.  Towards mobile cryptography , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[4]  Tal Rabin,et al.  Asynchronous secure computations with optimal resilience (extended abstract) , 1994, PODC '94.

[5]  Jan Camenisch,et al.  Cryptographic security for mobile code , 2001, Proceedings 2001 IEEE Symposium on Security and Privacy. S&P 2001.

[6]  Fritz Hohl.  An Approach to Solve the Problem of Malicious Hosts , 1998 .

[7]  David Chaum,et al.  Multiparty unconditionally secure protocols , 1988, STOC '88.

[8]  Ran Canetti,et al.  Asynchronous secure computation , 1993, STOC.

[9]  Rafail Ostrovsky,et al.  How To Withstand Mobile Virus Attacks , 1991, PODC 1991.

[10]  Ueli Maurer,et al.  Robustness for Free in Unconditional Multi-party Computation , 2001, CRYPTO.

[11]  Silvio Micali,et al.  How to play ANY mental game , 1987, STOC.

[12]  Ran Canetti,et al.  Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[13]  Avi Wigderson,et al.  Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.

[14]  Amit Sahai,et al.  On the (im)possibility of obfuscating programs , 2001, JACM.