David Baelde

A Method for Verifying Privacy-Type Properties: The Unbounded Case

2016

In this paper, we consider the problem of verifying anonymity and unlinkability in the symbolic model, where protocols are represented as processes in a variant of the applied pi calculus notably used in the ProVerif …