Computational and Symbolic Anonymity in an Unbounded Network

Abstract

We provide a formal model for protocols using ring signatures and prove that this model is computationally sound: if there is an attack in the computational world, then there is an attack in the formal (abstract) model. Our original contribution is that we consider security properties, such as anonymity, which are not properties of a single execution trace, while considering an unbounded number of sessions of the protocol.