Team Automata for Security: - A Survey -

In Kleijn, J., Team Automata for CSCW -- A Survey --, Petri Net Technology for Communication-Based Systems---Advances in Petri Nets, LNCS 2472, Springer, 2003, 295--320], Kleijn presented a survey of the use of team automata for the specification and analysis of phenomena from the field of computer supported cooperative work, in particular notions related to groupware systems. In this paper we present a survey of the use of team automata for the specification and analysis of some issues from the field of security. In particular, we show how team automata can adequately be used to model and verify various access control policies, multicast/broadcast communication protocols, and general (cryptographic) communication protocols.

[1]  Gavin Lowe,et al.  Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.

[2]  R.,et al.  A CLASSIFICATION OF SECURITY PROPERTIES FOR PROCESS ALGEBRAS 1 , 1994 .

[3]  David A. Wagner,et al.  Setuid Demystified , 2002, USENIX Security Symposium.

[4]  Hartmut Ehrig.  Petri Net Technology for communication-based systems : advances in Petri Nets , 2003 .

[5]  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.

[6]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

[7]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[8]  Gregor Engels,et al.  Towards Team-Automata-Driven Object-Oriented Collaborative Work , 2002, Formal and Natural Computing.

[9]  Steve Benford,et al.  An access control framework for multi-user collaborative environments , 1999, GROUP.

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

[11]  Nancy A. Lynch.  Input/Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, , 2003, CONCUR.

[12]  Gerard J. Holzmann,et al.  The SPIN Model Checker - primer and reference manual , 2003 .

[13]  Fabio Martinelli,et al.  A Uniform Approach for the Definition of Security Properties , 1999, World Congress on Formal Methods.

[14]  Danny Dolev,et al.  On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

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

[16]  Roberto Segala,et al.  A Compositional Trace-Based Semantics for Probabilistic Automata , 1995, CONCUR.

[17]  Clarence A. Ellis.  Team automata for groupware systems , 1997, GROUP '97.

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

[19]  M. Beek.  A Connict-free Strategy for Team-based Model Development , 2000 .

[20]  David A. Wagner,et al.  MOPS: an infrastructure for examining security properties of software , 2002, CCS '02.

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

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

[23]  Nancy A. Lynch,et al.  Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.

[24]  Roberto Gorrieri,et al.  The Compositional Security Checker: A Tool for the Verification of Information Flow Security Properties , 1997, IEEE Trans. Software Eng..

[25]  Lawrence Charles Paulson,et al.  Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[26]  Andrea Maggiolo-Schettini,et al.  Weak bisimulation for probabilistic timed automata and applications to security , 2003, First International Conference onSoftware Engineering and Formal Methods, 2003.Proceedings..

[27]  Volkmar Lotz,et al.  Formal Security Analysis with Interacting State Machines , 2002, ESORICS.

[28]  Fred B. Schneider,et al.  Enforceable security policies , 2000, TSEC.

[29]  Roberto Gorrieri,et al.  Classification of Security Properties (Part I: Information Flow) , 2000, FOSAD.

[30]  Carsten Rudolph,et al.  Role based specification and security analysis of cryptographic protocols using asynchronous product automata , 2002, Proceedings. 13th International Workshop on Database and Expert Systems Applications.

[31]  Prasun Dewan,et al.  Flexible meta access-control for collaborative applications , 1998, CSCW '98.

[32]  D. Elliott Bell,et al.  Secure Computer System: Unified Exposition and Multics Interpretation , 1976 .

[33]  Gabriele Lenzini,et al.  Team Automata for Security Analysis , 2004 .

[34]  Steve Benford,et al.  Access control in virtual environments , 1997, VRST '97.

[35]  J. Meseguer,et al.  Security Policies and Security Models , 1982, 1982 IEEE Symposium on Security and Privacy.

[36]  David von Oheimb.  Interacting State Machines: A Stateful Approach to Proving Security , 2002, FASec.

[37]  Fabio Martinelli,et al.  Compositional Verification of Secure Streamed Data: A Case Study with EMSS , 2003, ICTCS.

[38]  Ran Canetti,et al.  Efficient authentication and signing of multicast streams over lossy channels , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.

[39]  Hemang Lavana.  A Universally Configurable Architecture for Taskflow-Oriented Design of a Distributed Collaborative , 2000 .

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

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

[42]  Roberto Gorrieri,et al.  Classification of Security Properties - Part II: Network Security , 2002, FOSAD.

[43]  Roberto Gorrieri,et al.  Non Interference for the Analysis of Cryptographic Protocols , 2000, ICALP.

[44]  Kwang-Hoon Kim,et al.  A Framework and Taxonomy for Workflow Architecture , 2000, COOP.

[45]  Roberto Gorrieri,et al.  Secrecy in Security Protocols as Non Interference , 1999, Workshop on Secure Architectures and Information Flow.

[46]  G. Lowe,et al.  Breaking and Fixing the Needham-Schroeder Public-Key Protocol using CSP and FDR , 1996 .

[47]  Oliver Costich,et al.  A classical automata approach to noninterference type problems , 1992, [1992] Proceedings The Computer Security Foundations Workshop V.

[48]  Marinella Petrocchi,et al.  Modelling a Secure Agent with Team Automata , 2006, Electron. Notes Theor. Comput. Sci..