The dining cryptographers problem: Unconditional sender and recipient untraceability

  title={The dining cryptographers problem: Unconditional sender and recipient untraceability},
  author={David Chaum},
  journal={Journal of Cryptology},
  • D. Chaum
  • Published 1 March 1988
  • Computer Science, Mathematics
  • Journal of Cryptology
Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solution presented here is unconditionally or cryptographically secure, depending on whether it is based on one-time-use keys or on public keys, respectively. It can be adapted to address efficiently a wide variety of practical considerations. 

Dining Cryptographers are Practical

This work proposes an implementation of the dining cryptographers protocol which provides information-theoretical security for senders and recipients, and in which a disruptor with limited computational capabilities can easily be detected.

Dining Cryptographers are Practical (preliminary version)

This work proposes an implementation which provides information-theoretical security for senders and recipients, and in which a disruptor with limited computational capabilites can easily be detected.

Dining Cryptographers with 0.924 Verifiable Collision Resolution

A computationally secure dining cryptogra-phers protocol with collision resolution that achieves a maximum stable throughput of 0.924 messagesper round and which allows to easily detect disruptors.

Perfect Anonymity

  • Y. DesmedtF. Piper
  • Computer Science, Mathematics
    IEEE Transactions on Information Theory
  • 2019
A definition of perfect anonymity is given and the impact of Chaum’s MIX approach is discussed, namely, applying a uniformly random permutation on the plaintexts to be sent.

Dining Cryptographers Revisited

Dining cryptographers networks (or DC-nets) are a privacy-preserving primitive devised by Chaum for anonymous message publication. A very attractive feature of the basic DC-net is its

New Directions for Dining Cryptographers Computationally Secure Sender and Recipient

In the dining cryptographers protocol [7], a malicious participant can disrupt communication by providing a wrong output. Existing techniques only allow to limit the damage to some extent. This is a

Dining Cryptographers The Protocol

This chapter discusses dining cryptographer networks, a method to provide sender and receiver anonymity in a closed group network, and the implementation of the DC-protocol.

The Power of Anonymous Veto in Public Discussion

This paper proposes an exceptionally efficient solution to the Dining Cryptographers problem: Anonymous Veto Network (or AV-net), which provides the strongest protection of each input's privacy against collusion attacks and the efficiency of the protocol seems as good as one may hope for.

Unconditionally Secure Quantum Signatures

This paper aims to provide an accessible and comprehensive review of existing unconditionally secure secure signature schemes for signing classical messages, with a focus on unconditional or information-theoretic security quantum signature schemes.

Encryption and Group Authentication 1

The unconditionally secure asymmetric encryption scheme (GA-code), which is an encryption scheme with unconditional security and where it is impossible for a receiver to deduce the identity of a sender from the encrypted message, is defined and formalized.



Secure communications over insecure channels

This paper shows that it is possible to select a key over open communications channels in such a fashion that communications security can be maintained, and describes a method which forces any enemy to expend an amount of work which increases as the square of the work required of the two communicants to select the key.

Untraceable electronic mail, return addresses, and digital pseudonyms

A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of

New directions in cryptography

This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.

Security without identification: transaction systems to make big brother obsolete

The large-scale automated transaction systems of the near future can be designed to protect the privacy and maintain the security of both individuals and organizations.