home alluvium about me

Article – Efficient Byzantine k-Anonymous Broadcast

01 Aug 2006


Anonymous message transmission allows participants to exchange messages while keeping the sender and receiver identities private. Protocols based on the Dining Cryptographers problem are subject to jamming attacks by an adversary. We describe a novel technique to discover the identity of the adversary with no additional message complexity, and very low overhead.

Also see the followup paper: [Byzantine k-Anonymous Broadcast in O(Nf^2) Messages]