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:
“Roast Beef, Medium, is not only a food. It is a philosophy. Seated at Life’s Dining Table, with the menu of Morals before you, your eye wanders a bit over the entrées, the hors d’oeuvres, and the things à la though you know that Roast Beef, Medium, is safe and sane, and sure.”
—Edna Ferber (1887–1968)
“The problem is simply this: no one can feel like CEO of his or her life in the presence of the people who toilet trained her and spanked him when he was naughty. We may have become Masters of the Universe, accustomed to giving life and taking it away, casually ordering people into battle or out of their jobs . . . and yet we may still dirty our diapers at the sound of our mommy’s whimper or our daddy’s growl.”
—Frank Pittman (20th century)