home alluvium about me

Article – Byzantine k-Anonymous Broadcast in O(Nf^2) Messages

15 Aug 2006

Followup to [Efficient Byzantine k-Anonymous Broadcast]


Anonymous Broadcast protocols based on Dining Cryptographers are inefficient in message complexity, requiring O(N2) messages per round. We analyze a k-Anonymous protocol which remains live against Byzantine adversaries. We achieve message complexity of O(Nf2) messages per round against f Byzantine adversaries.