Privacy properties such as anonymity, unlink ability, or vote secrecy are typically expressed
as equivalence properties. In this paper, we provide the first decidability result for trace …

Symbolic methods have been used extensively for proving security of cryptographic
protocols in the Dolev-Yao model, and more recently for proving security of cryptographic …

Security in Embedded systems has become an important constraint in modern days. There
are different cryptographic algorithms developed for providing data security. Among these …

We present an approach to understanding first-order theories by exploring their models. A
typical use case is the analysis of artifacts such as policies, protocols, configurations, and …

Flaws in published standards for security protocols are found regularly, often after systems
implementing those standards have been deployed. Because of deployment constraints and …

Semirings as an algebraic structure have been known since 1934, but remained unapplied
for mathematical purposes for a long time. It has only been in the past decade that they have …

A limit to algorithmic verification of security protocols is posed by the fact that checking
whether a security property such as secrecy is satisfied is undecidable in general. In this …

We identify a new decidable class of security protocols, both for reachability and
equivalence properties. Our result holds for an unbounded number of sessions and for …

Enrich-by-need analysis characterizes all executions of a security protocol that extend a
given scenario. It computes a strongest security goal the protocol achieves in that scenario …

Analysing the security of cryptographic protocols by hand is a challenging endeavour. It
requires substantial expertise, weeks of intensive effort and the resulting proof of security …