Doubly-Anonymous Crowds: Using Secret-Sharing to achieve Sender- and Receiver-Anonymity
The dining cryptographers problem: Unconditional sender and recipient untraceability