Modelling a Secure Agent with Team Automata

We use Team Automata in order to model a protocol by Cachin et al. for securing agents in a hostile environment. Our study focuses on privacy properties of the agents. We use the framework to prove a result from the work by Cachin et al. As a by-product, our analysis gives some initial insight on the limits of the protocol. From a different perspective, this study continues a line of research on the expressive power and modelling capabilities of Team Automata. To the best of our knowledge, this is the first attempt to use Team Automata for the analysis of privacy properties.

[1]  Silvio Micali,et al.  Non-Interactive Oblivious Transfer and Applications , 1989, CRYPTO.

[2]  Andrew Chi-Chih Yao,et al.  How to generate and exchange secrets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[3]  Jetty Kleijn,et al.  Team Automata for CSCW - A Survey , 2003, Petri Net Technology for Communication-Based Systems.

[4]  Silvio Micali,et al.  The round complexity of secure protocols , 1990, STOC '90.

[5]  Christian F. Tschudin,et al.  Protecting Mobile Agents Against Malicious Hosts , 1998, Mobile Agents and Security.

[6]  Gabriele Lenzini,et al.  Team Automata for Security: - A Survey - , 2005, SecCo.

[7]  Joe Kilian,et al.  One-Round Secure Computation and Secure Autonomous Mobile Agents , 2000, ICALP.

[8]  李幼升,et al.  Ph , 1989 .

[9]  Gabriele Lenzini,et al.  Team Automata for Security Analysis of Multicast/Broadcast Communication , 2003 .

[10]  Grzegorz Rozenberg,et al.  Team automata for spatial access control , 2001, ECSCW.

[11]  Grzegorz Rozenberg,et al.  Synchronizations in Team Automata for Groupware Systems , 2003, Computer Supported Cooperative Work (CSCW).

[12]  Nancy A. Lynch,et al.  An introduction to input/output automata , 1989 .

[13]  A. Yao,et al.  Fair exchange with a semi-trusted third party (extended abstract) , 1997, CCS '97.

[14]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[15]  Nancy A. Lynch,et al.  I/O automaton models and proofs for shared-key communication systems , 1999, Proceedings of the 12th IEEE Computer Security Foundations Workshop.

[16]  Maurice H. ter Beek,et al.  Team Automata: A Formal Approach to the Modeling of Collaboration Between System Components , 2003 .