Spi Calculus Translated to --Calculus Preserving May-Tests

We present a concise and natural encoding of the spi-calculus into the more basic ?-calculus and establish its correctness with respect to a formal notion of testing.This is particularly relevant for security protocols modelled in spi since the tests can be viewed as adversaries.The translation has been implemented in a prototype tool.As a consequence, protocols can be described in the spi calculus and analysed with the emerging flora of tools already available for ?.The translation also entails a more detailed ooperational understanding of spi since high level constructs like encryption are encoded in a well known lower level.The formal correctness proof is nontrivial and interesting in its own; so called context bisimulations and new techniques for compositionality make the proof simpler and more concise.

[1]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[2]  Francesco Zappa Nardelli,et al.  Bisimulation Proof Methods for Mobile Ambients , 2003, ICALP.

[3]  Roberto M. Amadio,et al.  On the symbolic reduction of processes with cryptographic functions , 2003, Theor. Comput. Sci..

[4]  Rocco De Nicola,et al.  Testing Equivalence for Mobile Processes , 1995, Inf. Comput..

[5]  Michele Boreale,et al.  On the Expressiveness of Internal Mobility in Name-Passing Calculi , 1996, Theor. Comput. Sci..

[6]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[7]  Rocco De Nicola,et al.  Testing Equivalences for Processes , 1984, Theor. Comput. Sci..

[8]  Sergio Maffeis,et al.  On the Expressive Power of Polyadic Synchronisation in pi-calculus , 2002, EXPRESS.

[9]  Maria Grazia Buscemi,et al.  Experimenting with STA, a tool for automatic analysis of security protocols , 2002, SAC '02.

[10]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[11]  Uwe Nestmann,et al.  On Bisimulations for the Spi Calculus , 2002, AMAST.

[12]  Martín Abadi,et al.  A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.

[13]  Bruno Blanchet,et al.  An efficient cryptographic protocol verifier based on prolog rules , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[14]  Robin Milner,et al.  A Calculus of Mobile Processes, II , 1992, Inf. Comput..

[15]  Martín Abadi,et al.  Mobile values, new names, and secure communication , 2001, POPL '01.

[16]  Emilio Tuosto,et al.  From Co-algebraic Specifications to Implementation: The Mihda Toolkit , 2002, FMCO.

[17]  Faron Mollerz,et al.  The Mobility Workbench | a Tool for the -calculus | , 1994 .

[18]  Roberto M. Amadio,et al.  Reasoning about Higher-Order Processes , 1995, TAPSOFT.

[19]  C. R. Ramakrishnan,et al.  A logical encoding of the π-calculus: model checking mobile processes using tabled resolution , 2002, International Journal on Software Tools for Technology Transfer.

[20]  Faron Moller,et al.  The Mobility Workbench - A Tool for the pi-Calculus , 1994, CAV.