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. Anonymous communication problems which solve this problem are often referred to as DC-nets.
Despite the word dining, the dining cryptographers problem is unrelated to the dining philosophers problem.
Read more about Dining Cryptographers Problem: Description, Generalization, Limitations
Famous quotes containing the words dining and/or problem:
“Behind her was confusion in the room,
Of chairs turned upside down to sit like people
In other chairs, and something, come to look,
For every room a house has parlor, bedroom,
And dining room thrown pell-mell in the kitchen.”
—Robert Frost (1874–1963)
“The family environment in which your children are growing up is different from that in which you grew up. The decisions our parents made and the strategies they used were developed in a different context from what we face today, even if the “content” of the problem is the same. It is a mistake to think that our own experience as children and adolescents will give us all we need to help our children. The rules of the game have changed.”
—Lawrence Kutner (20th century)