Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Consistent, yet anonymous, Web access with LPWA
Communications of the ACM
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Enabling conferencing applications on the internet using an overlay muilticast architecture
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
How to Make Personalized Web Browising Simple, Secure, and Anonymous
FC '97 Proceedings of the First International Conference on Financial Cryptography
P5: A Protocol for Scalable Anonymous Communication
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Building Topology-Aware Overlays Using Global Soft-State
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A routing underlay for overlay networks
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Secure Anonymous Group Infrastructure for Common and Future Internet Applications
ACSAC '01 Proceedings of the 17th Annual Computer Security Applications Conference
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
A Distributed Approach to Solving Overlay Mismatching Problem
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Early experience with an internet broadcast system based on overlay multicast
ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
NetCamo: camouflaging network traffic for QoS-guaranteed mission critical applications
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Low-cost and reliable mutual anonymity protocols in peer-to-peer networks
IEEE Transactions on Parallel and Distributed Systems
A survey of security issues in multicast communications
IEEE Network: The Magazine of Global Internetworking
Mutual anonymous overlay multicast
Journal of Parallel and Distributed Computing - Special issue: Security in grid and distributed systems
Towards a tree-based taxonomy of anonymous networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Towards a taxonomy of wired and wireless anonymous networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Towards a (multi-)user-centric stack of (multi-)point-to-(multi-)point communication services
Proceedings of the 5th International Workshop on Enhanced Web Service Technologies
A modular framework for the development of peer-to-peer applications and services
International Journal of Grid and Utility Computing
Hi-index | 0.01 |
Multicast services are demanded by a variety of applications. Many applications require anonymity during their communication. However, there has been very little work on anonymous multicasting and such services are not available yet. Since there are fundamental differences between multicast and unicast, the solutions proposed for anonymity in unicast communications cannot be directly applied to multicast applications. In this paper we define the anonymous multicast system, and propose a mutual anonymous multicast (MAM) protocol including the design of a unicast mutual anonymity protocol and construction and optimization of an anonymous multicast tree. MAM is self organizing and completely distributed. We define the attack model in an anonymous multicast system and analyze the anonymity degree. We also evaluate the performance of MAM by simulations.