revert: Please get your copyright problems straight *before* re-adding your content -- an explicit "permission" is not enough, as you have been told *repeatedly* -- Wikipedia requires GFDL
The '''dining cryptographers protocol''' is a method of [[Anonymity|anonymous]] communication. It offers untraceability of both the sender and the recipient.
{{Redirect category shell|1=
The method is as follows: three or more [[cryptographer]]s ([[node (networking)|nodes]]) arrange themselves around a circular dinner table ([[ring network]]), with menus ([[link encryption|encrypted links]]) hiding the interaction of each pair of adjacent cryptographers from the rest. Every cryptographer picks a random number in private and shows it to the cryptographer to his right. Then each cryptographer computes the difference between his own number and the number he was shown by his neighbour to the left, adding a message if he wants to transmit one. He publicly announces the result. All cryptographers then add up the published numbers. If the sum is 0, no one sent a message. If the sum is a valid message, one cryptographer transmitted a message. If the sum is invalid, more than one cryptographer tried to transmit a message; they wait a random time and try again.
{{R from merge}}
}}
Recipient anonymity is simple: Everybody receives the message at the same time, so the message could be meant for anybody. Sender anonymity holds because no person knows the number of the person to his right. Therefore, for each person (other than himself) it appears to him to be equally likely that he is the one who added the message.
In case of two cryptographers, if one person does not transmit a message but a message is being broadcast, he obviously knows who sent it.
:''See also:'' [[cryptography]]
Compare: [[dining philosophers problem]]
== External links ==
* [http://cryptodox.com/Dining_cryptographers_protocol "Dining cryptographers protocol" at Cryptodox]
