1. D.J. Aldous, J.A. Fill, Reversible Markov Chains and Random Walks on Graphs, in preparation.
2. Buses for anonymous message delivery;Beimel;J. Cryptology,2003
3. Completeness theorems for non-cryptographic fault-tolerant distributed computation;Ben-Or,1988
4. Adaptively secure multi-party computation;Canetti,1996
5. Untraceable electronic mail, return addresses, and digital pseudonyms;Chaum;Commun. ACM,1981