High Quality Content by WIKIPEDIA articles! 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. Despite the word "dining", the dining cryptographers problem is unrelated to the dining philosophers problem. Three cryptographers gather around a table for dinner. The waiter informs them that the meal has been paid by someone, who could be one of the cryptographers or the National Security Agency (NSA). The cryptographers respect each other's right to make an anonymous payment, but want to find out whether the NSA paid. So they decide to execute a two-stage protocol.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.