Buses for anonymous message delivery

Journal of Cryptology

Volumn 16, Issue 1, 2003, Pages 25-39

  Beimel, Amos ^a   Dolev, Shlomi ^a  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

Anonymous communication; Privacy; Traffic analysis

Indexed keywords

INFORMATION ANALYSIS; MASS TRANSPORTATION; NETWORK PROTOCOLS; STATISTICAL METHODS;

ANONYMOUS COMMUNICATION; PRIVACY; PUBLIC TRANSPORTATION SYSTEM; TRAFFIC ANALYSIS; TRAVELING TIME;

CRYPTOGRAPHY;

EID: 13644250069     PISSN: 09332790     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00145-002-0128-6     Document Type: Article

References (16)

1. R. Aleliunas, R. M. Karp, R. J. Lipton, L. Lovász, and C. Rackoff. Random walks, universal traversal sequences, and the complexity of maze problems. In Proceedings of the 11th Annual ACM Symposium on the Theory of Computing, pp. 218-223, 1979.
2. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communication of the ACM, vol. 24, no. 2, pp. 84-88, 1981.
3. D. Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. Journal of Cryptology, vol. 1, no. 1, pp. 65-75, 1988.
4. J. Cheriyan and R. Thurimella. Approximating minimum-size k-connected spanning subgraphs via matching. SIAM Journal on Computing, vol. 30, no. 2, pp. 528-560, 2000.
5. S. Dolev, E. Kranakis, D. Krizanc, and D. Peleg. Bubbles: adaptive routing scheme for high-speed dynamic networks. SIAM Journal on Computing, vol. 29, no. 3, pp. 804-833, 1999.
6. S. Dolev and R. Ostrovsky. Xor-trees for efficient anonymous multicast and reception. ACM Transactions on Information and System Security, vol. 3, no. 2, pp. 63-84, 2000.
7. O. Goldreich. Fragments on a chapter on encryption schemes. Extracts from Foundations of Cryptography, vol. 2 (in preparation), 2001. Available from http://www.wisdom.weizmann.ac.il/~oded/ foc-vol2.html.
8. O. Goldreich. Fragments on a chapter on digital signature and message authentication. Extracts from Foundations of Cryptography, vol. 2 (in preparation), 2001. Available from http://www.wisdom. weizmann.ac.il/~oded/foc-vol2.html.
9. S. Goldwasser and S. Micali. Probabilistic encryption. Journal of Computer and System Sciences, vol. 28, no. 21, pp. 270-299, 1984.
10. K. Menger. Allgemeinen kurventheorie. Fundamente Mathematicae, 10, pp. 96-115, 1927.
11. A. Pfitzmann. How to implement ISDNs without user observability - some remarks. TR 14/85, Fakultat fur Informatik, Universitat Karlsruhe, 1985.
12. A. Pfitzmann, B. Pfitzmann, and M. Waidner. ISDN-MIXes - untraceable communication with very small bandwidth overhead. In Kommunikation in verteilten Systemen, Proceedings, pp. 451-463, 1991.
13. C. Rackoff and D. Simon. Cryptographic defense against traffic analysis. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 672-681, 1993.
14. M. G. Reed, P. F. Syverson, and D. M. Goldschlag. Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communication, vol. 16, no. 4, pp. 482-494, 1998.
15. M. Waidner and B. Pfitzmann. The dining cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability. In Advances in Cryptology - EUROCRYPT 89, vol. 434 of LNCS, p. 690, Springer-Verlag, Berlin, 1990.
16. A. C. Yao. Protocols for secure computations. In Proceedings of the 23th Annual IEEE Symposium on Foundations of Computer Science, pp. 160-164, 1982.