Efficient anonymous channel and all/nothing election scheme
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Anonymity, unobservability, and pseudeonymity — a proposal for terminology
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Web MIXes: a system for anonymous and unobservable Internet access
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
A mathematical theory of communication
ACM SIGMOBILE Mobile Computing and Communications Review
Chord: a scalable peer-to-peer lookup protocol for internet applications
IEEE/ACM Transactions on Networking (TON)
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Small Worlds: The Dynamics of Networks between Order and Randomness
Small Worlds: The Dynamics of Networks between Order and Randomness
Beyond anarchy: self-organized topology for peer to peer networks
Complexity - Special issue: Resilient and adaptive defense of computing networks
Mutual anonymous overlay multicast
Journal of Parallel and Distributed Computing - Special issue: Security in grid and distributed systems
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
How to break a practical MIX and design a new one
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
IEEE Communications Magazine
Analysis of the performance of dynamic multicast routing algorithms
Computer Communications
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
Routing of multipoint connections
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
This paper presents a Recipient-Anonymous DataDelivery (RAD), tailored and optimized for stable-topology networks. There is one simplistic approach for achieving recipient anonymity. If a message is equally broadcasted to all network entities (e.g., routers and hosts), an adversary cannot infer any traffic patterns for the intended recipient. While this technique is unconditionally secure, no one believes that this is a practical solution except in some special network environments since it requires extremely expensive traffic overhead. In this paper we realize this idea with an efficient multicast protocol by introducing the concept of a public routing proxy. A public routing proxy enables a sender to deliver a message to the intended recipient anonymously since the public routing proxy multicasts the message to a set of k network entities including the intended recipient. Thus, in the proposed protocol, the recipient's k-anonymity can be unconditionally guaranteed. We also demonstrate the practicality of the proposed protocol through intensive simulation based on well-known network topologies.