The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability

David Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. J. Cryptology, 1(1):65-75, 1988.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.