Indistinguishability properties are essential in formal verification of cryptographic protocols.
They are needed to model anonymity properties, strong versions of confidentiality, and …

Observational equivalence allows us to study important security properties such as
anonymity. Unfortunately, the difficulty of proving observational equivalence hinders …

Cryptographic protocols form the backbone of our digital society. Unfortunately, the security
of numerous critical components has been neglected. As a consequence, attacks have …

This report demonstrates a technique for proving the anonymity guarantees of
communication systems, using a mechanised theorem-prover. The approach is based on …

Operational models of protocols, on one hand, are readable and conveniently match their
implementation, at a certain abstraction level. Epistemic models, on the other hand, are …

The popularity of Internet applications has made communication privacy an increasingly
important security requirement. As an important aspect of privacy, anonymity ensures that a …

With the emergence of computers and the internet, the collection, storage and processing of
information about private lives is becoming ubiquitous. Large amounts of data about citizens …

We present formal definitions of anonymity properties for voting protocols using the process
algebra CSP. We analyse a number of anonymity definitions, and give formal definitions for …

Anonymity is the property of keeping secret the identity of the user performing a certain
action. The need for anonymity may arise in a wide range of situations, like electronic voting …

Abstract Models in process algebra with abstract data types can be analysed by state space
generation and reduction tools. The μ CRL toolset implements a suite of distributed …