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} }
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.Â
Supplemental Presentations
Topics from this paper
1,396 Citations
Dining Cryptographers with 0.924 Verifiable Collision Resolution
- Computer Science
- Ann. UMCS Informatica
- 2014
- 5
- PDF
Efficient Votes Storage in a Non-Interactive Dining Cryptographers (NIDC) Protocol
- Computer Science
- 2017
- 1
The Power of Anonymous Veto in Public Discussion
- Computer Science
- Trans. Comput. Sci.
- 2009
- 14
- Highly Influenced
- PDF
References
SHOWING 1-4 OF 4 REFERENCES
Untraceable electronic mail, return addresses, and digital pseudonyms
- Computer Science
- CACM
- 1981
- 3,030
- PDF
Security without identification: transaction systems to make big brother obsolete
- Computer Science
- CACM
- 1985
- 1,596
- PDF