Reference

[Chaum88] Chaum, D The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. In Journal of Cryptology, 1: 65-75, 1988.
Downloads: bibAbstract. Abstract. Keeping confidential who sends which messages, in a world where any physical transmission can be traced to its origin, seems impossible. The solu-tion 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.