Dining Cryptographers Protocol

The dining cryptographers protocol is a method of anonymous communication. It offers untraceability of both the sender and the recipient. The method is as follows: two or more cryptographers arrange themselves around a circular dinner table, with menus hiding the interaction of each pair of adjacent cryptographers from the rest. Each adjacent pair picks a random number in private. Then each cryptographer announces publicly the difference between the number on his right and the number on his left, adding a message if he wants to transmit one. All cryptographers then add up the publicly announced 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.
See also: cryptography
Compare: dining philosophers problem

 

<< PreviousWord BrowserNext >>
subway (restaurant)
amungme
enxet
root beer
captain kangaroo
bob keeshan
cicada
scott bakula
charles rennie mackintosh
charles macintosh
government granted monopoly
teachtext
edit application
textedit
rc
lysander
tina arena
saturday
friday
thursday
wednesday
tuesday
young talent time
usenet cabal
gas electric hybrid engine
manowar (band)
solar flare
chromosphere
terror
you can't do that on television
mixmaster anonymous remailer
anonymous remailer
97 bc
desperate dan
the bash street kids
early infanticidal childrearing
basilica
cypherpunk anonymous remailer
co np complete
np hard
98 bc
p complete
96 bc
pspace complete