Revision as of 03:19, 21 March 2010 edit 70.92.155.187 (talk) capitalized links for consistency ← Previous edit		Revision as of 23:20, 24 September 2010 edit undo 77.200.233.39 (talk) →Disadvantages: I doubt it's a "byte" here Next edit →
Line 18: ===Disadvantages=== * <math>n^2</math> bytes transfer for one ~~byte~~bit in case of peer to peer communication where n is number of participants. As mentioned above, this can be reduced to <math>2n</math> if there is no possibility of collusion between participants, but in many cases even this lower bound is intractable. * Malicious party can inject random bits to corrupt the message. Chaum present trap messages can prevent malicious data.

Dining cryptographers protocol: Difference between revisions