The dining cryptographers problem: Unconditional sender and recipient untraceability
- Cite this article as:
- Chaum, D. J. Cryptology (1988) 1: 65. doi:10.1007/BF00206326
- 783 Downloads
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.