• DOI:10.1007/BF00206326
Corpus ID: 2664614

The dining cryptographers problem: Unconditional sender and recipient untraceability

@article{Chaum2004TheDC,
  title={The dining cryptographers problem: Unconditional sender and recipient untraceability},
  author={D. Chaum},
  journal={Journal of Cryptology},
  year={2004},
  volume={1},
  pages={65-75}
}

D. Chaum

Published 2004

Mathematics, Computer Science

Journal of Cryptology

View on Springer

ir.cwi.nl

Save to Library

Create Alert

Cite

Launch Research Feed

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.