Characterising the computational power of an intruder in the Applied Pi-Calculus

Eike Ritter

(Birmingham)

The Applied Pi-Calculus has been used successfully as a formalism to
verify security protocols. Many important security properties can be
modelled as observational equivalences in this calculus. An important
part of such an observational equivalence between two processes is to
show that the computational power of an intruder is the same for both
processes. In this talk we give a characterisation the computational
power of an intruder.

This is joint work with Aybkek Mukhamedov and Mark Ryan.
Tuesday 28th October 2008, 14:00
Robert Recorde Room
Department of Computer Science