Synchronizations in Team Automata for Groupware Systems
Computer Supported Cooperative Work
Non-Interactive Oblivious Transfer and Spplications
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
I/O Automaton Models and Proofs for Shared-Key Communication Systems
CSFW '99 Proceedings of the 12th IEEE workshop on Computer Security Foundations
The round complexity of secure protocols
The round complexity of secure protocols
Team automata for spatial access control
ECSCW'01 Proceedings of the seventh conference on European Conference on Computer Supported Cooperative Work
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
A team automaton scenario for the analysis of security properties of communication protocols
Journal of Automata, Languages and Combinatorics
| Hi-index | 0.00 |
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.