eprintid: 335
rev_number: 9
eprint_status: archive
userid: 32
dir: disk0/00/00/03/35
datestamp: 2011-06-09 09:20:22
lastmod: 2011-07-11 14:36:26
status_changed: 2011-06-09 09:20:22
type: book_section
metadata_visibility: show
item_issues_count: 0
creators_name: Boreale, Michele
creators_name: De Nicola, Rocco
creators_name: Pugliese, Rosario
creators_id: 
creators_id: r.denicola@imtlucca.it
creators_id: 
title: Process Algebraic Analysis of Cryptographic Protocols
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
abstract: 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. 
date: 2000
date_type: published
series: IFIP Conference Proceedings
volume: 183
publisher: Kluwer
pagerange: 375-392
refereed: TRUE
isbn: 0-7923-7968-3
book_title: Formal Techniques for Distributed System Development (FORTE 2000)
editors_name: Bolognesi, Tommaso
editors_name: Latella, Diego
citation:   Boreale, Michele and De Nicola, Rocco and Pugliese, Rosario  Process Algebraic Analysis of Cryptographic Protocols.   In:  Formal Techniques for Distributed System Development (FORTE 2000).   IFIP Conference Proceedings, 183 .  Kluwer, pp. 375-392.  ISBN 0-7923-7968-3      (2000)