Journal of Cryptology

, Volume 1, Issue 1, pp 65–75

The dining cryptographers problem: Unconditional sender and recipient untraceability

  • David Chaum
Article

Abstract

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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