We introduce the notion of parameterised anonymity, to formalize the anonymity property of protocols with an arbitrary number of participants. This definition is an extension of the well known CSP anonymity formalization of Schneider and Sidiropoulos . Using recently developed invariant techniques for solving parameterised boolean equation systems, we then show that the Dining Cryptographers protocol guarantees parameterised anonymity with respect to outside observers. We also argue that although the question whether a protocol guarantees parameterised anonymity is in general undecidable, there are practical subclasses where anonymity can be decided for any group of processes.
|Title of host publication
|Formal Aspects in Security and Trust (5th International Workshop, FAST 2008, Malaga, Spain, October 9-10, 2008. Revised Selected Papers)
|P. Degano, J. Guttman, F. Martinelli
|Place of Publication
|Number of pages
|Published - 2009
|Lecture Notes in Computer Science