e/Dining cryptographers problem

Information
has gloss	eng: In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-OR function. David Chaum first proposed this problem in 1988, and used it as an illustrative example to show it was possible to send anonymous messages with unconditional sender and recipient untraceability.
lexicalization	eng: dining cryptographers problem
instance of	e/Mathematical problem

Media
media:img	Dinning cryptographers.png