%X Recent approaches to the analysis of crypto-protocols build on concepts which are well-established in the field of process algebras, such as labelled transition systems (lts) and observational semantics. We outline some recent work in this direction that stems from using cryptographic versions of the pi-calculus -- most notably Abadi and Gordon's spi-calculus -- as protocol description languages. We show the impact of these approaches on a specific example, a simplified version of the Kerberos protocol. 
%P 375-392
%S IFIP Conference Proceedings
%T Process Algebraic Analysis of Cryptographic Protocols
%E Tommaso Bolognesi
%E Diego Latella
%A Michele Boreale
%A Rocco De Nicola
%A Rosario Pugliese
%L eprints335
%I Kluwer
%V 183
%D 2000
%B Formal Techniques for Distributed System Development (FORTE 2000)