Journal of Cryptology

, Volume 1, Issue 1, pp 65–75 | Cite as

The dining cryptographers problem: Unconditional sender and recipient untraceability

  • David Chaum


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.

Key words

Untraceability Unconditional Security Pseudonymity 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Chaum, D., Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms, Communications of the ACM, vol. 24, no. 2, February 1981, pp. 84–88.Google Scholar
  2. [2]
    Chaum, D., Security Without Identification: Transaction Systems to Make Big Brother Obsolete, Communications of the ACM, vol. 28, no. 10, October 1985, pp. 1030–1044.Google Scholar
  3. [3]
    Diffie, W., and Hellman, M. E., New Directions in Cryptography, IEEE Transactions on Information Theory, vol. 22, no. 6, November 1976, pp. 644–654.Google Scholar
  4. [4]
    Merkle, R. C., Secure Communication over Insecure Channels, Communications of the ACM, vol. 21, no. 4, 1978, pp. 294–299.Google Scholar
  5. [5]
    Tanenbaum, A. S., Computer Networks, Prentice Hall, Englewood Cliffs, New Jersey, 1981.Google Scholar

Copyright information

© International Association for Cryptologic Research 1988

Authors and Affiliations

  • David Chaum
    • 1
  1. 1.Centre for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations