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
  • 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. 
    1,396 Citations

    Topics from this paper

    Dining Cryptographers are Practical
    • 3
    • PDF
    Dining Cryptographers are Practical (preliminary version)
    • 2
    Dining Cryptographers with 0.924 Verifiable Collision Resolution
    • C. Franck
    • Computer Science
    • Ann. UMCS Informatica
    • 2014
    • 5
    • PDF
    Perfect Anonymity
    • Highly Influenced
    Dining Cryptographers Revisited
    • 161
    • PDF
    ANOTHER TWIST IN THE DINING CRYPTOGRAPHERS’ PROTOCOL
    • 2
    • Highly Influenced
    • PDF
    Dining Cryptographers The Protocol
    • 1
    • Highly Influenced
    • PDF
    Efficient Votes Storage in a Non-Interactive Dining Cryptographers (NIDC) Protocol
    • 1
    The Power of Anonymous Veto in Public Discussion
    • 14
    • Highly Influenced
    • PDF

    References

    SHOWING 1-4 OF 4 REFERENCES
    Secure communications over insecure channels
    • 656
    • PDF
    Untraceable electronic mail, return addresses, and digital pseudonyms
    • 3,030
    • PDF
    New directions in cryptography
    • 13,684
    • PDF