WebAbstract The dining cryptographers network (or DC-net) is a seminal technique devised by Chaum to solve the dining cryptographers problem — namely, how to send a boolean-OR bit anonymously from a group of participants. In this paper, we investigate the weaknesses of DC-nets, study alternative methods and propose a new way to tackle this problem. In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-XOR function. David Chaum first proposed this problem in the early 1980s and used it as an illustrative example to show that it was possible to send anonymous messages with … See more Three cryptographers gather around a table for dinner. The waiter informs them that the meal has been paid for by someone, who could be one of the cryptographers or the National Security Agency (NSA). … See more DC-nets are readily generalized to allow for transmissions of more than one bit per round, for groups larger than three participants, and for arbitrary "alphabets" other than the … See more Herbivore divides a large anonymity network into smaller DC-net groups, enabling participants to evade disruption attempts by leaving a disrupted group and joining another group, until the participant finds a group free of disruptors. This evasion approach … See more The DC-net protocol is simple and elegant. It has several limitations, however, some solutions to which have been explored in follow-up research (see the References section below). See more David Chaum first thought about this problem in the early 1980s. The first publication that outlines the basic underlying ideas is … See more The measure originally suggested by David Chaum to avoid collisions is to retransmit the message once a collision is detected, but the paper does not explain exactly how to … See more

Modern Cryptography: Theory and Applications - Stanford University

WebMay 14, 2024 · In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-OR function. Here is a presentation of the dining … WebThe Dining Cryptographers problem studies how to securely compute the boolean-OR function while preserving the privacy of each input bit. Since its first introduction by … fth giessen opac

CH-IMP Example: Dining Cryptographers - University of …

WebInformally, it solves the following problem: if a group of dining cryptographers are told that their restaurant bill has been paid and they want to establish whether it was paid by one of them or by an external party, how can a payer inside the group reveal the fact that they paid without also disclosing their identity? WebUnobservable communication over fully untrusted infrastructure Sebastian Angel UT Austin and NYU Srinath Setty Microsoft Research Abstract Keeping communication private has become increas- fth gießen podcast