Another twist in the dining cryptographers' protocol

Abstract

In this paper, we explore the Dining Cryptographers' protocol over a cyclic group with a one-way homomorphic image, using a boardroom voting protocol as an illustration of its desirable security properties. In particular, we address the problem of anonymous disruption, which is one of the main disadvantages of DC over more usual groups like binary vectors.