We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus[13, 14, 15] as a modelling tool. A Type system using boolean annotations g...
We study the interaction of the "new" construct with a rich but common form of (first-order) communication. This interaction is crucial in security protocols, which are ...
We present a symbolic framework for refinement and composition of security protocols. ework uses the notion of ideal functionalities. These are abstract systems which are secure b...
In computing systems, trust is an expectation on the dynamic behavior of an agent; static analysis is a collection of techniques for establishing static bounds on the dynamic behav...
We present a formal, symbolic definition of election verifiability for electronic voting protocols in the context of the applied pi calculus. Our definition is given in terms of bo...