References
- IEEE Trans. Inform. Theory. v.31 no.4 A public key cryptosystem and signature scheme based on discrete logarithms T. ElGamal
- Communications of the Association for Computing Machinery v.21 no.2 A method for abtaining digital signatures and public-key cryptosystems R. L. Rivest;A. Shamir;L. Adleman
- Communications of the ACM v.24 no.2 Untraceble Electoronic Mail, Return Addresses, and Digital Pseudonyms D.L. Chaum
- Journal of Cryptology v.1 no.1 The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability D.L. Chaum
- Advances in Cryptology, Proceedings of Eurocrypt'89 How to break the direct RSA implementation of MIXes B.Pfitzmann;A.Pfitzmann
- Advances in Cryptology, Proceedings of Eurocrypt'94 Breaking an efficient anonymous channels B.Pfitzmann
- Advances in Cryptology, Proceedings of Eurocrypt'93 Efficient Anonymous Channel and All/Nothing Election Scheme C.S. Park;K.Itoh;K.Kurosawa
- Proceedings of 25th ACM Symposium on Theory of Computing Cryptographic Defense Against Traffic Analysis C.Rackoff;D.R.Simon
- Advances in Cryptology, Proceedings of Eurocrypt'89 The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability M.Waidner;B.Pfitzmann
- Advances in Cryptology, Proceedings of Eurocrypt'89 Detection of Disrupters in the DC Protocol J.Bos;B. den Boer
- Advances in Cryptology, Proceedings of Eurocrypt'89 Unconditional Sender and Receipient Untraceability in spite of Active Attacks M.Waidner
- Advances in Cryptology, Proceedings of Eurocrypt'85 Networks without user abservability - design options A.Pfitzmann;M. Waidner