M2: Multicasting mixes for efficient and anonymous communication

Proceedings - International Conference on Distributed Computing Systems

Volumn 2006, Issue , 2006, Pages

  Perng, Ginger ^a   Reiter, Michael K ^a   Wang, Chenxi ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSUMERS; MESSAGES; UNLINKABILITY;

CARRIER COMMUNICATION; INFORMATION DISSEMINATION; MULTIMEDIA SERVICES; TELECOMMUNICATION INDUSTRY; TELECOMMUNICATION NETWORKS;

MULTICASTING;

EID: 33947710012     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2006.53     Document Type: Conference Paper

References (17)

1. R. Z. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47-97, 2002.
2. T. Ballardie. Scalable multicast key distribution. IETF RFC 1949, 1994.
3. O. Berthold, A. Pfitzmann, and R. Standtke. The disadvantages of free mix routes and how to overcome them. In Privacy Enhancing Technologies Workshop, 2000.
4. M. Burmester and Y. Desmedt. A secure and efficient conference key distribution system. In Eurocrypt, 1994.
5. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, February 1981.
6. C. Diaz, S. Seys, J. Claessens, and B. Preneel. Towards measuring anonymity. In Privacy Enhancing Technologies Workshop, 2002.
7. E. Gabber, P. B. Gibbons, Y. Matias, and A. Mayer. How to make personalized web browsing simple, secure, and anonymous. In Financial Cryptography, 1997.
8. C. Grosch. Framework for anonymity in ip-multicast environments. In Globecom, 2000.
9. C. Gulcu and G. Tsudik. Mixing email with Babel. In Network and Distributed Systems Security, 1996.
10. S. Janson, T. Luczak, and A. Ruci. Random Graphs. Wiley and Sons, 2000.
11. D. Mazieres and M. F. Kaashoek. The design, implementation and operation of an email pseudonym server. In Proceedings of the 5th ACM Conference on Computer and Communications Security, pages 27-36, 1998.
12. A. Pfitzmann, B. Pfitzmann, and M. Waidner. Isdn-mixes untraceable communication with very small bandwith overhead. In GI/TTG Conference on Communication in Distributed Systems, 1991.
13. A. Pfitzmann and M. Waidner. Networks without user observability. Computers & Security, 2(6): 158-166, 1987.
14. A. Serjantov and G. Danezis. Towards an information theoretic metric for anonymity. In Privacy Enhancing Technologies Workshop, 2002.
15. C. Shields and B. N. Levine. A protocol for anonymous communication over the internet. In Computer and Communication Security, 2000.
16. N. Weiler. Secure anonymous group infrastructure for common and future internet applications. In Computer Security Applications Conference, 2001.
17. C. K. Wong, M. Gouda, and S. S. Lam. Secure group communication using key graphs. In ACM SIGCOMM, 1998.