Generalization
The protocol can be generalized to a group of participants, each with a shared secret key in common with each other participant. In each round of the protocol, if a participant wants to transmit an untraceable message to the group they invert their publicly announced bit.
The participants can be visualized as a fully connected graph with the vertices representing the participants and the edges representing their shared secret keys.
Read more about this topic: Dining Cryptographers Problem