The BTA protocol for biometric authentication of online banking transactions is extended to allow for multiple person authenticated transactions. In addition a formal specification is given, the protocol is modelled in the applied pi calculus and the security properties of data and person authentication as well as non-repudiation are verified using the tool ProVerif.

A contextual semantics – defined in terms of successful termination and mayand shouldconvergence – is analyzed in the synchronous pi-calculus with replication and a constant Stop to denote success. The contextual ordering is analyzed, some nontrivial process equivalences are proved, and proof tools for showing contextual equivalences are provided. Among them are a context lemma and new notions ...

In this paper Acquisti voting protocol is modeled in applied pi calculus. Soundness and coercion-resistance are verified with the automatic tool ProVerif. The result shows that Acquisti protocol has the soundness and coercion-resistance in some conditions. To our best knowledge, the first automatic analysis of Acquisti protocol for an unbounded number of honest and corrupted voters is

We formally study two privacy-type properties for e-auction protocols: bidding-price-secrecy and receipt-freeness. These properties are formalised as observational equivalences in the applied pi calculus. We analyse the receipt-free auction protocol by Abe and Suzuki. Bidding-price-secrecy of the protocol is verified using the automatic verifier ProVerif, whereas receipt-freeness of the protoco...

This paper compares the expressiveness of different fragments of ambient calculi via leader election problems. We consider Mobile Ambients (MA), Safe Ambients (SA) and the Push and Pull Ambient Calculus (PAC). Cardelli and Gordon encoded the asynchronous pi-calculus into MA. Zimmer has shown that the synchronous pi-calculus without choice can be encoded in pure (no communication) SA. We show th...

We study whether, in the π-calculus, the match prefix—a conditional operator testing two names for (syntactic) equality—is expressible via the other operators. Previously, Carbone and Maffeis proved that matching is not expressible this way under rather strong requirements (preservation and reflection of observables). Later on, Gorla developed a by now widely-tested set of criteria for encoding...

In this dissertation, we consider a distributed implementation of the π-calculus, more precisely, the version of the π-calculus with mixed choice. To this end, we present the probabilistic asynchronous π-calculus, which is an extension of the asynchronous πcalculus enhanced with a notion of random choice. We define an operational semantics which distinguishes between probabilistic choice, made ...