Solving the Collision Problem of DC Nets

Jeroen van de Graaf

The Dining Cryptographers protocol, invented by Chaum in the early 80s, provides anonymous broadcast with unconditional privacy. A practical problem, however, are the collisions: Suppose that each of the n parties wants to send a message. To preserve anonymity, parties must choose a slot at random, implying that two or more parties can end up choosing the same slot, thus causing a collision and destroying the messages transmitted. In this take we will give a brief history of solutions to the collision problem, and present some novel approaches.