Algebraic State Machines: Concepts and Applications to Security
The concept of algebraic state machine has been introduced in  as a state transition system the states of which are each defined as an algebra, and that communicate through channels.
To make efficient use of this concept, one needs a formal semantics, as well as notions of composition and refinement, which are provided in the present work. To demonstrate their usefulness for an application area of major interest, we show how to extend algebraic state machines with data types modelling cryptographic operations and with an adversary model to reason about security-critical systems. As an example we consider a cryptographic protocol proposed in the literature.
KeywordsSecurity Protocol Formal Semantic Output Channel Cryptographic Protocol Adversary Model
Unable to display preview. Download preview PDF.
- 1.Apostolopoulos, V., Peris, V., Saha, D.: Transport layer security: How much does it really cost? In: Conference on Computer Communications (IEEE Infocom), New York (March 1999)Google Scholar
- 4.Gurevich, Y.: Evolving algebras 1993: Lipari guide. In: Börger, E. (ed.) Specification and Validation Methods, pp. 9–36. OUP (1995)Google Scholar
- 6.Jürjens, J.: Formal Semantics for Interacting UML subsystems. In: 5th Interna- tional Conference on Formal Methods for Open Object-Based Distributed Systems (FMOODS 2002), pp. 29–44. IFIP, Kluwer (2002)Google Scholar
- 7.Jürjens, J.: Secure Systems Development with UML. Springer, Heidelberg (2003) (in preparation)Google Scholar