Xor-Trees for Efficient Anonymous Multicast and Reception

ACM Transactions on Information and System Security

Volumn 3, Issue 2, 2000, Pages 63-84

  Dolev, Shlomi ^a   Ostrovsky, Rafail ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TELCORDIA TECHNOLOGIES   (United States)

Author keywords

Algorithms; Anonymous communication; anonymous multicast; Security

Indexed keywords

EID: 0011586610     PISSN: 10949224     EISSN: 15577406     Source Type: Journal    
DOI: 10.1145/354876.354877     Document Type: Article

References (20)

1. Ben-Or, M., Goldwasser, S., and Wigderson, A. 1988. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC '88, Chicago, IL, May 2-4), J. Simon, Chair. ACM Press, New York, NY, 1-10
2. Blum, M. and Micali, S. 1984. How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 4 (Nov.), 850-864
3. Bos, J. and Den Boer, B. 1990. Detection of disrupters in the DC protocol. In Proceedings of the Workshop on Advances in Cryptology (EUROCRYPT '89, Houthalen, Belgium, Apr. 10-13), J.-J. Quisquater and J. Vandewalle, Eds. Springer Lecture Notes in Computer Science. Springer-Verlag, New York, NY, 320-327
4. Canetti, R., Feige, U., Goldreich, O., and Naor, M. 1996. Adaptively secure multi-party computation. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC '96, Philadelphia, PA, May 22-24), G. L. Miller, Chair. ACM Press, New York, NY, 639-648
5. Canetti, R., Kushilevitz, E., Ostrovsky, R., and Rosen, A. 1997. Randomness vs. fault-tolerance. In Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing (PODC '97, Santa Barbara, CA, Aug. 21-24), J. E. Burns and H. Attiya, Chairs. ACM Press, New York, NY, 35-44
6. Chaum, D. 1981. Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24, 2 (Feb.), 84-88
7. Chaum, D. 1988. The dining cryptographers problem: Unconditional sender and recipient untraceability. J. Cryptology 1, 1, 65-75
8. Chaum, D. and Damgard, I. 1988. Multiparty unconditionally secure protocols. In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing (STOC '88, Chicago, IL, May 2-4), J. Simon, Chair. ACM Press, New York, NY, 11-19
9. Franklin, M., Galil, Z., and Yung, M. 1993. Eavesdropping games: A graph-theoretic approach to privacy in distributed systems. In Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS '93). IEEE Computer Society Press, Los Alamitos, CA
10. Goldreich, O., Micali, S., and Wigderson, A. 1987. How to play ANY mental game. In Proceedings of the 19th Annual ACM Conference on Theory of Computing (STOC '87, New York, NY, May 25-27), A. V. Aho, Ed. ACM Press, New York, NY, 218-229
11. Hastad, J., Impagliazzo, R., Levin, L. A., and Luby, M. 1999. Construction of a pseudorandom generator from any one-way function. SIAM J. Comput. 28, 4, 1364-1396
12. Knuth, D. E. 1997. The Art of Computer Programming. 3rd ed. Addison-Wesley, Reading, MA
13. Kushilevitz, E., Micali, S., and Ostrovsky, R. 1994. Reducibility and completeness in multi-party private computations. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (Nov.). IEEE Computer Society Press, Los Alamitos, CA
14. Pfitzmann, A. 1985. How to implement ISDNs without user observability: some remarks. Tech Rep. TR 14/85. University of Karlsruhe, Germany
15. Pfitzmann, A. and Waidner, M. 1987. Networks without user observability. Comput. Secur. 6, 2 (Apr.), 158-166
16. Pfitzmann, A., Pfitzmann, B., and Waidner, M. 1991. ISDN-mixes: Untraceable communication with very small bandwidth overhead. In Proceedings of the GI/ITG Conference on Communication in Distributed Systems (Feb., Mannheim, Germany). 451-463
17. Rackoff, C. and Simon, D. R. 1993. Cryptographic defense against traffic analysis. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC '93, San Diego, CA, May 16-18), R. Kosaraju, D. Johnson, and A. Aggarwal, Chairs. ACM Press, New York, NY, 672-681
18. Syverson, P. F., Goldschlag, D. M., and Reed, M. G. 1997. Anonymous connections and onion routing. In Proceedings of the 1997 IEEE Computer Society Symposium on Reasearch in Security and Privacy (Oakland, CA, May). IEEE Computer Society Press, Los Alamitos, CA
19. Waidner, M. 1990. Unconditional sender and recipient untraceability in spite of active attacks. In Proceedings of the Workshop on Advances in Cryptology (EUROCRYPT '89, Houthalen, Belgium, Apr. 10-13), J.-J. Quisquater and J. Vandewalle, Eds. Springer Lecture Notes in Computer Science. Springer-Verlag, New York, NY, 302-319
20. Waidner, M. and Pfitzmann, B. 1990. The dining cryptographers in the disco: Unconditional sender and recipient untraceability with computationally secure serviceability. In Proceedings of the Workshop on Advances in Cryptology (EUROCRYPT '89, Houthalen, Belgium, Apr. 10-13), J.-J. Quisquater and J. Vandewalle, Eds. Springer Lecture Notes in Computer Science. Springer-Verlag, New York, NY, 690